Pages that link to "Item:Q1675651"
From MaRDI portal
The following pages link to Fractional 0-1 programming: applications and algorithms (Q1675651):
Displayed 11 items.
- Exact approaches for competitive facility location with discrete attractiveness (Q828655) (← links)
- Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule (Q2030506) (← links)
- Column generation extensions of set covering greedy heuristics (Q2102849) (← links)
- Fractional 0-1 programming and submodularity (Q2162513) (← links)
- Solving a class of feature selection problems via fractional 0--1 programming (Q2241181) (← links)
- Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations (Q2274883) (← links)
- Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS problems (Q2399489) (← links)
- Exact solution approaches for a class of bilevel fractional programs (Q2679008) (← links)
- A Mixed-Integer Fractional Optimization Approach to Best Subset Selection (Q4995087) (← links)
- On maximum ratio clique relaxations (Q6085884) (← links)
- A portfolio optimization approach to design of congested multi‐service networks with application in community healthcare: fractional 0‐1 programming (Q6092601) (← links)