Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions—Modeling Implications

References

• [1] Balas E (2011) Projecting systems of linear inequalities with binary variables. Ann. Oper. Res. 188(1):19–31.Crossref, Google Scholar
• [2] Barvinok A (2002) A Course in Convexity, Graduate Studies in Mathematics, vol. 54 (American Mathematical Society, Providence, RI).Google Scholar
• [3] Basu A, Conforti M, Cornuéjols G, Zambelli G (2010) Maximal lattice-free convex sets in linear subspaces. Math. Oper. Res. 35(3):704–720.Link, Google Scholar
• [4] Basu A, Martin K, Ryan CT, Wang G (2017) Mixed-integer linear representability, disjunctions, and variable elimination. Eisenbrand F, Koenemann J, eds. International Conference on Integer Programming and Combinatorial Optimization. IPCO 2017, Lecture Notes in Computer Science, vol. 10328 (Springer, Cham, Switzerland), 75–85.Crossref, Google Scholar
• [5] Blair CE, Jeroslow RG (1982) The value function of an integer program. Math. Programming 23(1):237–273.Crossref, Google Scholar
• [6] Conforti M, Cornuéjols G, Zambelli G (2014) Integer Programming, Graduate Texts in Mathematics, vol. 271 (Springer, Cham, Switzerland).Google Scholar
• [7] Del Pia A, Poskin J (2016) On the mixed binary representability of ellipsoidal regions. Louveaux Q, Skutella M, eds. International Conference on Integer Programming and Combinatorial Optimization. IPCO 2016, Lecture Notes in Computer Science, vol. 9682 (Springer, Cham, Switzerland), 214–225.Crossref, Google Scholar
• [8] Dey SS, et al.. (2013) Some properties of convex hulls of integer points contained in general convex sets. Math. Programming 141(1/2):507–526.Crossref, Google Scholar
• [9] Jeroslow RG, Lowe JK (1984) Modelling with integer variables. Korte B, Ritter K, eds. Mathematical Programming at Oberwolfach II, Mathematical Programming Studies, vol. 22 (Springer-Verlag, Berlin), 167–184.Crossref, Google Scholar
• [10] Lovász L (1989) Geometry of numbers and integer programming. Mathematical Programming, vol. 6 (SCIPRESS, Tokyo), 177–201.Google Scholar
• [11] Lubin M, Zadik I, Vielma JP (2017) Mixed-integer convex representability. Eisenbrand F, Koenemann J, eds. Internat. Conf. Integer Programming Combinatorial Optim. IPCO 2017, Lecture Notes in Computer Science, vol. 10328 (Springer, Cham, Switzerland), 392–404.Crossref, Google Scholar
• [12] Lubin M, Zadik I, Vielma JP (2017) Regularity in mixed-integer convex representability. Working paper, Google, New York.Google Scholar
• [13] Martin RK (1999) Large Scale Linear and Integer Optimization: A Unified Approach (Springer, New York).Crossref, Google Scholar
• [14] Ryan J (1986) Integral monoid duality models. Unpublished doctoral thesis, Cornell University, Ithaca, NY.Google Scholar
• [15] Ryan J (1991) Decomposing finitely generated integral monoids by elimination. Linear Algebra Appl. 153:209–217.Crossref, Google Scholar
• [16] Schrijver A (1986) Theory of Linear and Integer Programming (Wiley, Chichester, UK).Google Scholar
• [17] Vielma JP (2015) Mixed integer linear programming formulation techniques. SIAM Rev. 57(1):3–57.Crossref, Google Scholar
• [18] Williams HP (1976) Fourier-Motzkin elimination extension to integer programming problems. J. Combin. Theory A 21(1):118–123.Crossref, Google Scholar
• [19] Williams HP (1986) Fourier’s method of linear programming and its dual. Amer. Math. Monthly 93(9):681–695.Crossref, Google Scholar
• [20] Williams HP (1992) The elimination of integer variables. J. Oper. Res. Soc. 43(5):387–393.Crossref, Google Scholar
• [21] Williams HP, Hooker JN (2016) Integer programming as projection. Discrete Optim. 22:291–311.Crossref, Google Scholar
• [22] Wolsey LA (1981) Integer programming duality: Price functions and sensitivity analysis. Math. Programming 20(1):173–195.Crossref, Google Scholar
• [23] Wolsey LA (1981) The b-hull of an integer program. Discrete Appl. Math. 3(3):193–201.Crossref, Google Scholar