Binary Extended Formulations and Sequential Convexification

References

• [1] Balas E (1998) Disjunctive programming: Properties of the convex hull of feasible points. Discrete Appl. Math. 89(1):3–44.Crossref, Google Scholar
• [2] Basu A, Conforti M, Di Summa M, Jiang H (2020) Complexity of branch-and-bound and cutting planes in mixed-integer optimization–II. Preprint, submitted November 11, https://arxiv.org/abs/2011.05474.Google Scholar
• [3] Bonami P, Margot F (2015) Cut generation through binarization. Math. Programming 154(1):197–223.Crossref, Google Scholar
• [4] Conforti M, Cornuéjols G, Zambelli G (2010) Extended formulations in combinatorial optimization. 4OR 8(1):1–48.Crossref, Google Scholar
• [5] Conforti M, Cornuéjols G, Zambelli G (2014) Integer Programming, vol. 271 (Springer, New York).Crossref, Google Scholar
• [6] Conforti M, Di Summa M, Faenza Y (2020b) Balas formulation for the union of polytopes is optimal. Math. Programming 180(1):311–326.Crossref, Google Scholar
• [7] Conforti M, De Santis M, Di Summa M, Rinaldi F (2021) Scanning integer points with lex-inequalities: A finite cutting plane algorithm for integer programming with linear objective. 4OR 19:531–548.Crossref, Google Scholar
• [8] Conforti M, Del Pia A, Di Summa M, Faenza Y, Grappe R (2015) Reverse Chvátal–Gomory rank. SIAM J. Discrete Math. 29(1):166–181.Crossref, Google Scholar
• [9] Cook WJ, Kannan R, Schrijver A (1990) Chvátal closures for mixed integer programming problems. Math. Programming 47:155–174.Crossref, Google Scholar
• [10] Dash S, Günlük O, Hildebrand R (2018) Binary extended formulations of polyhedral mixed-integer sets. Math. Programming 170(1):207–236.Crossref, Google Scholar
• [11] Gillmann R, Kaibel V (2006) Revlex-initial 0/1-polytopes. J. Combin. Theory Ser. A 113(5):799–821.Crossref, Google Scholar
• [12] Gupte A (2016) Convex hulls of superincreasing knapsacks and lexicographic orderings. Discrete Appl. Math. 201:150–163.Crossref, Google Scholar
• [13] Owen JH, Mehrotra S (2002) On the value of binary expansions for general mixed-integer linear programs. Oper. Res. 50(5):810–819.Link, Google Scholar
• [14] Roy JS (2007) “Binarize and project” to generate cuts for general mixed-integer programs. Algorithmic Oper. Res. 2(1):37–51.Google Scholar
• [15] Sherali HD, Adams WP (1990) A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3(3):411–430.Crossref, Google Scholar
• [16] Sherali HD, Adams WP (2013) A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, vol. 31 (Springer Science & Business Media, New York).Google Scholar