Pages that link to "Item:Q1178714"
From MaRDI portal
The following pages link to Using separation algorithms to generate mixed integer model reformulations (Q1178714):
Displayed 20 items.
- Mixed integer linear programming formulations for probabilistic constraints (Q439901) (← links)
- A time-indexed LP-based approach for min-sum job-shop problems (Q646647) (← links)
- Extended formulations for polygons (Q714985) (← links)
- Characterization of facets of the hop constrained chain polytope via dynamic programming (Q741741) (← links)
- Intermediate integer programming representations using value disjunctions (Q951104) (← links)
- Strong formulations for mixed integer programming: A survey (Q1121789) (← links)
- A result on projection for the vehicle routing problem (Q1127162) (← links)
- The splitting of variables and constraints in the formulation of integer programming models (Q1278148) (← links)
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems (Q1319550) (← links)
- Node packings on cocomparability graphs (Q1400341) (← links)
- Compact vs. exponential-size LP relaxations (Q1612003) (← links)
- Long range planning in the process industries: A projection approach (Q1919201) (← links)
- Some \(0/1\) polytopes need exponential size extended formulations (Q2434987) (← links)
- The \(k\)-Track assignment problem on partial orders (Q2464438) (← links)
- The prize-collecting generalized minimum spanning tree problem (Q2476612) (← links)
- Polyhedral description of the integer single node flow set with constant bounds (Q2583130) (← links)
- A branch-and-cut algorithm for multiple sequence alignment (Q2583133) (← links)
- An effective compact formulation of the max cut problem on sparse graphs (Q2840693) (← links)
- Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem (Q2940057) (← links)
- Deriving compact extended formulations via LP-based separation techniques (Q5892024) (← links)