Optimal Cutting Planes from the Group Relaxations

References

• [1] Balas E (1971) Intersection cuts—A new type of cutting planes for integer programming. Oper. Res. 19(1):19–39.Link, Google Scholar
• [2] Balas E, Saxena A (2008) Optimizing over the split closure. Math Programming 113(2):219–240.Crossref, Google Scholar
• [3] Balas E, Ceria S, Cornuéjols G, Natraj NR (1996) Gomory cuts revisited. Oper. Res. Lett. 19(1):1–9.Crossref, Google Scholar
• [4] Basu A, Conforti M, Di Summa M (2015) A geometric approach to cut-generating functions. Math. Programming 151(1):153–189.Crossref, Google Scholar
• [5] Basu A, Hildebrand R, Köppe M (2016) Light on the infinite group relaxation I: Foundations and taxonomy. 4OR 14(1):1–40.Crossref, Google Scholar
• [6] Basu A, Hildebrand R, Köppe M (2016) Light on the infinite group relaxation II: Sufficient conditions for extremality, sequences, and algorithms. 4OR 14(2):1–25.Crossref, Google Scholar
• [7] Basu A, Conforti M, Di Summa M, Paat J (2017) The structure of the infinite models in integer programming. Eisenbrand F, Koenemann J, eds. Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, vol. 10328 (Springer, Cham, Switzerland), 63–74.Google Scholar
• [8] Bixby RE, Fenelon M, Gu Z, Rothberg E, Wunderling R (2004) Mixed integer programming: A progress report. Groetschel M, ed. The Sharpest Cut, MPS-SIAM Series on Optimization, vol. 4 (SIAM, Philadelphia), 309–325.Crossref, Google Scholar
• [9] Bowman V, Nemhauser G (1970) A finiteness proof for modified Dantzig cuts in integer programming. Naval Res. Logist. 17(3):309–313.Crossref, Google Scholar
• [10] Dantzig GB (1959) Note on solving linear programs in integers. Naval Res. Logist. 6(1):75–76.Crossref, Google Scholar
• [11] Dash S, Günlük O, Lodi A (2010) MIR closures of polyhedral sets. Math. Programming 121(1):33–60.Crossref, Google Scholar
• [12] Gomory R (1960) An algorithm for the mixed integer problem. Report RM-2597-PR, RAND Corporation, Santa Monica, California.Google Scholar
• [13] Gomory R (1963) An algorithm for integer solutions to linear programs. Graves RL, Wolfe P, eds. Recent Advances in Mathematical Programming (McGraw-Hill, New York), 269–302.Google Scholar
• [14] Gomory RE (1958) Outline of an algorithm for integer solutions to linear programs. Bull. Amer. Math. Soc. 64(5):275–278.Crossref, Google Scholar
• [15] Gomory RE (1965) On the relation between integer and noninteger solutions to linear programs. Proc. Natl. Acad. Sci. USA 53(2):260–265.Crossref, Google Scholar
• [16] Gomory RE (1969) Some polyhedra related to combinatorial problems. Linear Algebra Appl. 2(4):451–558.Crossref, Google Scholar
• [17] Gomory RE, Johnson EL (1972) Some continuous functions related to corner polyhedra, I. Math. Programming 3(1):23–85.Crossref, Google Scholar
• [18] Gomory RE, Johnson EL (1972) Some continuous functions related to corner polyhedra, II. Math. Programming 3(1):359–389.Crossref, Google Scholar
• [19] Gomory RE, Johnson EL (2003) T-space and cutting planes. Math. Programming 96(2):341–375.Crossref, Google Scholar
• [20] Johnson EL (1974) On the group problem for mixed integer programming. Balinsky ML, ed. Mathematical Programming Studies, vol. 2 (Springer, Berlin), 137–179.Google Scholar
• [21] Kemperman J (1964) On products of sets in a locally compact group. Fundamenta Mathematicae 56(1):51–68.Crossref, Google Scholar
• [22] Lieb EH, Loss M (2001) Analysis, Graduate Studies in Mathematics, vol. 14 (American Mathematical Society, Providence, RI).Google Scholar
• [23] Nathanson MB (1996) Additive Number Theory: Inverse Problems and the Geometry of Sumsets, Graduate Texts in Mathematics, vol. 165 (Springer-Verlag, New York).Crossref, Google Scholar
• [24] Royden HL, Fitzpatrick P (1968) Real Analysis, vol. 2 (Macmillan, New York).Google Scholar
• [25] Rubin DS, Graves RL (1972) Strengthened Dantzig cuts for integer programming. Oper. Res. 20(1):178–182.Link, Google Scholar
• [26] Rudin W (1976) Principles of Mathematical Analysis, 3rd ed. (McGraw-Hill, New York).Google Scholar