Pages that link to "Item:Q1694780"

The following pages link to A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems (Q1694780):

Displayed 10 items.

• Fractional 0-1 programming: applications and algorithms (Q1675651) ‎ (← links)
• A note on linearized reformulations for a class of bilevel linear integer problems (Q1730617) ‎ (← links)
• Green supply chain design with emission sensitive demand: second order cone programming formulation and case study (Q1996755) ‎ (← links)
• A geometric branch-and-bound algorithm for the service bundle design problem (Q2160490) ‎ (← links)
• Fractional 0-1 programming and submodularity (Q2162513) ‎ (← 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)
• Submodularity in Conic Quadratic Mixed 0–1 Optimization (Q5131480) ‎ (← 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)