Cutting Planes and the Elementary Closure in Fixed Dimension

References

• Bárány I., Howe R., Lovász L. On integer points in polyhedra: A lower bound. Combinatorica (1992) 12(2):135–142Crossref, Google Scholar
• Bockmayr A., Eisenbrand F., Hartmann M. E., Schulz A. S. On the Chvátal rank of polytopes in the 0/1 cube. Discrete Appl. Math. (1999) 98:21–27Crossref, Google Scholar
• Caprara A., Fischetti M., Letchford A. N. On the separation of maximally violated mod-k cuts. Math. Programming (2000) 87(1):37–56Crossref, Google Scholar
• Chvátal V. Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Math. (1973) 4:305–337Crossref, Google Scholar
• Cook W. Cutting-plane proofs in polynomial space. Math. Programming (1990) 47:11–18Crossref, Google Scholar
• Cook W., Coullard C. R., Turán G. On the complexity of cutting plane proofs. Discrete Appl. Math. (1987) 18:25–38Crossref, Google Scholar
• Cook W., Cunningham W. H., Pulleyblank W. R., Schrijver A.Combinatorial Optimization (1998) (John Wiley, New York) Google Scholar
• Cook W., Hartmann M. E., Kannan R., McDiarmid C. On integer points in polyhedra. Combinatorica (1992) 12(1):27–37Crossref, Google Scholar
• Coppersmith D., Winograd S. Matrix multiplication via arithmetic progressions. J. Symbolic Comput. (1990) 9(3):251–280Crossref, Google Scholar
• Edmonds J., Giles R. A min-max relation for submodular functions on graphs. Stud. Integer Programming. Ann. Discrete Math. (1977) 1:185–204Crossref, Google Scholar
• Eisenbrand F. On the membership problem for the elementary closure of a polyhedron. Combinatorica (1999) 19(2):297–300Crossref, Google Scholar
• Eisenbrand F., Schulz A. S., Cornuéjols G., Burkard R. E., Woeginger G. J. Bounds on the Chvátal rank of polytopes in the 0/1 cube. Integer Programming and Combinatorial Optim. IPCO 99 (1999) (Springer, Berlin, Germany) 137–150LNCS 1610Crossref, Google Scholar
• Giles F. R., Pulleyblank W. R. Total dual integrality and integer polyhedra. Linear Algebra and its Appl. (1979) 25:191–196Crossref, Google Scholar
• Gomory R. E. Faces of an integer polyhedron. Proc. National Acad. Sci. United States of Amer. (1967) 57:16–18Crossref, Google Scholar
• Gomory R. E. Outline of an algorithm for integer solutions to linear programs. Bull. Amer. Math. Soc. (1958) 64:275–278Crossref, Google Scholar
• Hafner J. L., McCurley K. S. Asymptotically fast triangularization of matrices over rings. SIAM J. Comput. (1991) 20(6):1068–1083Crossref, Google Scholar
• Hayes A. C., Larman D. G. The vertices of the knapsack polytope. Discrete Appl. Math. (1983) 6:135–138Crossref, Google Scholar
• Howell J. A. Spans in the module (Zm)s. Linear and Multilinear Algebra (1986) 19:67–77Crossref, Google Scholar
• Hung M. S., Rom W. O. An application of the Hermite normal form in integer programming. Linear Algebra and its Appl. (1990) 140:163–179Crossref, Google Scholar
• Kannan R., Bachem A. Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix. SIAM J. Comput. (1979) 8(4):499–507Crossref, Google Scholar
• Lenstra H. W. Integer programming with a fixed number of variables. Math. Oper. Res. (1983) 8(4):538–548Link, Google Scholar
• Letchford A. N. Totally tight rank-1 Chvátal-Gomory cuts. (1999) . Working paper ⟨ http://www.lancs.ac.uk/staff/letchfoa/pubs.htm⟩Google Scholar
• Lovász L., Scarf H. E. The generalized basis reduction algorithm. Math. Oper. Res. (1992) 17(3):751–764Link, Google Scholar
• Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (John Wiley, New York) Crossref, Google Scholar
• Niven I., Zuckerman H. S., Montgomery H. L.An Introduction to the Theory of Numbers (1991) 5th ed.(Wiley, New York) Google Scholar
• Schrijver A.Theory of Linear and Integer Programming (1986) (John Wiley, New York) Google Scholar
• Schrijver A. On cutting planes. Ann. Discrete Math. (1980) 9:291–296Crossref, Google Scholar
• Storjohann A., Labahn G., Lakshman Y. N. Asymptotically fast computation of Hermite normal forms of integer matrices. Internat. Sympos. Symbolic and Algebraic Comput. ISSAC '96 (1996) (ACM Press, New York) 259–266Crossref, Google Scholar
• Storjohann A., Mulders T., Bilardi N. G., Italiano G. F., Pietracaprina A., Pucci G. Fast algorithms for linear algebra modulo. 6th Ann. Eur. Sympos. Algorithms, ESA '98 (1998) 1461(Springer)139–150Lecture Notes in Computer ScienceCrossref, Google Scholar