Tightening simple mixed-integer sets with guaranteed bounds
- 31 December 2010
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 133 (1-2) , 337-363
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Approximate formulations for 0-1 knapsack setsOperations Research Letters, 2008
- Approximate extended formulationsMathematical Programming, 2005
- Approximate fixed-rank closures of covering problemsMathematical Programming, 2005
- Tree-width and the Sherali–Adams operatorDiscrete Optimization, 2004
- Subset Algebra Lift Operators for 0-1 Integer ProgrammingSIAM Journal on Optimization, 2004
- On the Matrix-Cut Rank of PolyhedraMathematics of Operations Research, 2001
- Lifted flow cover inequalities for mixed 0-1 integer programsMathematical Programming, 1999
- A lift-and-project cutting plane algorithm for mixed 0–1 programsMathematical Programming, 1993
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming ProblemsSIAM Journal on Discrete Mathematics, 1990
- Approximation algorithms for the m-dimensional 0–1 knapsack problem: Worst-case and probabilistic analysesEuropean Journal of Operational Research, 1984