A variant of the Buchberger algorithm for integer programming

SIAM Journal on Discrete Mathematics

Volumn 10, Issue 1, 1997, Pages 96-108

  Urbaniak, Regina ^a   Weismantel, Robert ^a   Ziegler, Günter M ^b  

^a ZUSE INSTITUTE BERLIN   (Germany)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Buchberger algorithm; Gr bner bases; Integer programming; Iterative improvement heuristics; Test sets; Upper bounds

Indexed keywords

EID: 0012692786     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480195281209     Document Type: Article

References (16)

1. TH. BETH, D. JUNGNICKEL, AND H. LENZ, Design Theory, B.I.-Wissenschaftsverlag, Bibliographisches Institut, Zürich, 1985; Cambridge University Press, London, 1993.
2. R. E. BIXBY, E. A. BOYD, AND R. R. INDOVINA, MIPLIB: A test set of mixed integer programming problems, SIAM News, 25 (1992), p. 16; available from Rice University SOFTLIB at softlib.cs.rice.edu and from ZIB eLib electronic library at elib.zib-berlin.de.
3. R. BORNDÖRFER AND R. WEISMANTEL, Solving Set Partitioning Problems via Cutting Planes, ZIB-Berlin, 1995, preprint.
4. B. BUCHBERGER, Gröbner bases: An algorithmic method in polynomial ideal theory, in Multi-dimensional Systems Theory, N. K. Böse, ed., D. Reidel, 1985, pp. 184-232.
5. P. CONTI AND C. TRAVERSO, Buchberger algorithm and integer programming, Lecture Notes in Comput. Sci., 539 (1991), pp. 130-139.
6. D. A. COX, J. B. LITTLE, AND D. O'SHEA, Ideals, Varieties, and Algorithms. An Introduction to Computational Algebraic Geometry and Commutative Algebra, Undergraduate Texts in Mathematics, Springer-Verlag, New York, 1992.
7. C. E. FERREIRA, A. MARTIN, AND R. WEISMANTEL, Solving multiple knapsack problems by cutting planes, SIAM J. Optim., 6 (1996), pp. 858-877.
8. H. HEITKOTTER, Personal communication, Universität Dortmund, 1993.
9. K. L. HUFFMAN AND M. PADBERG, Solving airline crew-scheduling problems by branch-and-cut, Management Science, 39 (1993), pp. 657-682.
10. S. HOŞTEN AND B. STURMFELS, GRIN: An implementation of Gröbner bases for integer programming, Lecture Notes in Comput. Sci., 920 (1995), pp. 267-276.
11. B. W. KERNIGHAN AND S. LIN, An efficient heuristic procedure for partitioning graphs, Bell Systems Technical Journal, 49 (1970), pp. 291-307.
12. B. W. KERNIGHAN AND S. LIN, An effective heuristic algorithm for the traveling salesman problem, Oper. Res., 21 (1973), pp. 498-516.
13. L. POTTIER, Gröbner Bases of Toric Ideals: Properties, Algorithms, and Applications, Rapport de Recherche de I'INRIA RR 2224, Sophia Antipolis, 1994.
14. A. SASSANO, On the facial structure of the set covering polytope, Math. Programming, 44 (1989), pp. 181-202.
15. R. R. THOMAS, A geometric Buchberger algorithm for integer programming, Math. Oper. Res., 20 (1995), pp. 864-884.
16. R. R. THOMAS AND R. WEISMANTEL, Truncated Gröbner bases for integer programming, AAECC, to appear.