Compact formulations as a union of polyhedra
- 6 March 2007
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 114 (2) , 277-289
Abstract
No abstract availableKeywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Valid inequalities for mixed integer linear programsMathematical Programming, 2007
- Strong Formulations of Robust Mixed 0–1 ProgrammingMathematical Programming, 2006
- Tight formulations for some simple mixed integer programs and convex objective integer programsMathematical Programming, 2003
- Tight Mip Formulation for Multi-Item Discrete Lot-Sizing ProblemsOperations Research, 2003
- On capacitated network design cut?set polyhedraMathematical Programming, 2002
- On the dimension of projected polyhedraDiscrete Applied Mathematics, 1998
- The Sequential Knapsack PolytopeSIAM Journal on Optimization, 1998
- Integer knapsack and flow covers with divisible coefficients: polyhedra, optimization and separationDiscrete Applied Mathematics, 1995
- Polyhedra for lot-sizing with Wagner—Whitin costsMathematical Programming, 1994
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable RedefinitionOperations Research, 1987