Binary Extended Formulations and Sequential Convexification
- 1 August 2024
- journal article
- research article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 49 (3) , 1566-1581
Abstract
No abstract availableKeywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Convex hulls of superincreasing knapsacks and lexicographic orderingsDiscrete Applied Mathematics, 2016
- Cut generation through binarizationMathematical Programming, 2015
- Reverse Chvátal--Gomory RankSIAM Journal on Discrete Mathematics, 2015
- Integer Programming2014
- Extended formulations in combinatorial optimization4OR, 2010
- Revlex-initial 0/1-polytopesJournal of Combinatorial Theory, Series A, 2006
- On the Value of Binary Expansions for General Mixed-Integer Linear ProgramsOperations Research, 2002
- Disjunctive programming: Properties of the convex hull of feasible pointsDiscrete Applied Mathematics, 1998
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming ProblemsSIAM Journal on Discrete Mathematics, 1990
- Chvátal closures for mixed integer programming problemsMathematical Programming, 1990