Compact formulations as a union of polyhedra
From MaRDI portal
Publication:927156
DOI10.1007/s10107-007-0101-0zbMath1145.90044OpenAlexW2066022516MaRDI QIDQ927156
Laurence A. Wolsey, Michele Conforti
Publication date: 4 June 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-007-0101-0
Related Items
On the minimum cut separator problem, Single item lot-sizing with non-decreasing capacities, Ideal, non-extended formulations for disjunctive constraints admitting a network representation, Covering Linear Programming with Violations, The Mixing Set with Divisible Capacities, On mixing sets arising in chance-constrained programming, Extended formulations in combinatorial optimization, Extended formulations in combinatorial optimization, Mixing polyhedra with two non divisible coefficients, A compact formulation of a mixed-integer set, Valid inequalities for mixed integer linear programs, Mixed Integer Linear Programming Formulation Techniques, Between steps: intermediate relaxations between big-M and convex hull formulations
Cites Work
- Unnamed Item
- Unnamed Item
- Valid inequalities for mixed integer linear programs
- On the dimension of projected polyhedra
- Tight formulations for some simple mixed integer programs and convex objective integer programs
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- Polyhedra for lot-sizing with Wagner-Whitin costs
- Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
- A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. (Abstract of thesis)
- Strong formulations of robust mixed 0-1 programming
- Polyhedral description of the integer single node flow set with constant bounds
- Approximate extended formulations
- The Mixing Set with Flows
- Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems
- Valid Linear Inequalities for Fixed Charge Problems
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- The Sequential Knapsack Polytope
- The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows
- Production Planning by Mixed Integer Programming
- The Continuous Mixing Polyhedron