n-step mingling inequalities: new facets for the mixed-integer knapsack set
Open Access
- 25 May 2010
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 132 (1-2) , 79-98
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Mingling: mixed-integer rounding with boundsMathematical Programming, 2009
- Generalized mixed integer rounding inequalities: facets for infinite group polyhedraMathematical Programming, 2008
- Cover and Pack Inequalities for (Mixed) Integer ProgrammingAnnals of Operations Research, 2005
- Valid inequalities based on simple mixed-integer setsMathematical Programming, 2005
- Sequence Independent Lifting for Mixed-Integer ProgrammingOperations Research, 2004
- On the facets of the mixed?integer knapsack polyhedronMathematical Programming, 2003
- On the group problem for mixed integer programming1974
- Some continuous functions related to corner polyhedra, IIMathematical Programming, 1972
- Some continuous functions related to corner polyhedraMathematical Programming, 1972
- Some polyhedra related to combinatorial problemsLinear Algebra and its Applications, 1969