Cutting planes and the elementary closure in fixed dimension

Mathematics of Operations Research

Volumn 26, Issue 2, 2001, Pages 304-312

  Bockmayr, A ^a   Eisenbrand, F ^a  

^a UNIVERSITÉ DE LORRAINE   (France)

Author keywords

Complexity; Cutting plane; Elementary closure; Integer programming

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; POLYNOMIALS; SET THEORY;

CUTTING PLANE METHODS;

INTEGER PROGRAMMING;

EID: 0035351612     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.26.2.304.10555     Document Type: Article

References (29)

1. On integer points in polyhedra: A lower bound
2. On the Chvátal rank of polytopes in the 0/1 cube
3. On the separation of maximally violated mod-k cuts
4. Edmonds polytopes and a hierarchy of combinatorial problems
5. Cutting-plane proofs in polynomial space
6. On the complexity of cutting plane proofs
7. On integer points in polyhedra
8. Matrix multiplication via arithmetic progressions
9. A min-max relation for submodular functions on graphs
10. On the membership problem for the elementary closure of a polyhedron
11. Bounds on the Chvátal rank of polytopes in the 0/1 cube
12. Total dual integrality and integer polyhedra
13. Faces of an integer polyhedron
14. Outline of an algorithm for integer solutions to linear programs
15. Asymptotically fast triangularization of matrices over rings
16. The vertices of the knapsack polytope
17. s
18. An application of the Hermite normal form in integer programming
19. Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix
20. Integer programming with a fixed number of variables
21. Totally tight rank-1 Chvátal-Gomory cuts
22. The generalized basis reduction algorithm
23. On cutting planes
24. Asymptotically fast computation of Hermite normal forms of integer matrices
25. Fast algorithms for linear algebra modulo