Abstract
‘Integer programming’ is a basic mathematical problem, of central importance in Optimization and Operations Research. While a systematic body of theory has been developed for it in the last fifty years [14], it has been realized only very recently, first by Conti & Traverso [5], that the Buchberger algorithm (cf. Chapter 1) provides a solution strategy for integer programming problems, in particular in the case of families of programs with ‘varying right hand side’.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
W.W. Adams and P. Loustaunau (1994): An Introduction to Gröbner Bases, Graduate Studies in Math., Vol. III, American Math. Soc, Providence R.I.
T. Becker and V. Weispfennig (1993): Gröbner Bases: A Computational Approach to Commutative Algebra, Graduate Texts in Mathematics 141, Springer-Verlag, New York Berlin Heidelberg.
B. Buchberger (1985): Gröbner bases: An algorithmic method in polynomial ideal theory, in: N.K. Bose (ed.), ‘Multidimensional Systems Theory’, D. Reidel, 184–232.
V. Chvátal (1983): Linear Programming, Freeman, New York.
P. Conti and C. Traverso (1991): Buchberger algorithm and integer programming, pp. 130–139 in Proceedings AAECC-9 (New Orleans), Springer, Lecture Notes in Computer Science 539.
D. A. Cox, J. B. Little, and D. O’Shea (1992): Ideals, Varieties, and Algorithms. An Introduction to Computational Algebraic Geometry and Commutative Algebra, Undergraduate Texts in Mathematics, Springer-Verlag, New York Berlin Heidelberg.
F. Di Biase and R. Urbanke (1995): An algorithm to calculate the kernel of certain polynomial ring homomorphisms, Experimental Math. 4, 227–234.
D. Eisenbud and B. Sturmfels (1996): Binomial ideals, Duke Math. J. 84, 1–45.
R. E. Gomory (1969): Some polyhedra related to combinatorial problems, Linear Algebra and its Applications 2, 451–455.
S. Hosten and B. Sturmfels (1995): GRIN: An implementation of Gröbner bases for integer programming, pp. 267–276 in: “Integer Programming and Combinatorial Optimization” (E. Balas, J. Clausen, eds.), Proc. 4th Int. IPCO Conference (Copenhagen, May), Lecture Notes in Computer Science 920, Springer-Verlag, Berlin Heidelberg New York.
Q. Li, Y. Guo, T. Ida, and J. Darlington (1997): The minimised geometric Buchberger algorithm: An optimal algebraic algorithm for integer programming, pp. 331–338 in: Proc. ISSAC’97, ACM Press.
C. Moulinet and L. Pottier (1997): Gröbner bases of toric ideals: properties, algorithms, and applications, preprint, INRIA Sophia Antipolis, 10 pages.
N. R. Natraj, S. R. Tayur, and R. R. Thomas (1995): An algebraic geometry algorithm for scheduling in presence of setups and correlated demands, Math. Programming 69A, 369–401.
A. Schrijver (1986): Theory of Linear and Integer Programming, Wiley-Interscience, Chichester.
B. Sturmfels (1995): Gröbner Bases and Convex Polytopes, AMS University Lecture Series, Vol. 8, American Math. Soc, Providence RI.
B. Sturmfels and R. R. Thomas (1997): Variation of cost functions in integer programming, Math. Programming 77, 357–387.
B. Sturmfels, R. Weismantel, and G.M. Ziegler (1995): Gröbner bases of lattices, corner polyhedra, and integer programming, Beiträge Algebra und Geometrie/Contributions to Algebra and Geometry 36, 281–298.
R. R. Thomas (1995): A geometric Buchberger algorithm for integer programming, Math. Operations Research 20, 864–884.
R. R. Thomas (1994): Gröbner basis methods for integer programming, Ph. D. Thesis, Cornell University, 157 pages.
R. R. Thomas and R. Weismantel (1997): Truncated Gröbner bases for integer programming, Applicable Algebra in Engineering, Communication and Computing (AAIECC), 8, 241–257.
R. Urbaniak, R. Weismantel, and G. M. Ziegler (1997): A variant of Buch-berger’s algorithm for integer programming, SIAM J. Discrete Math. 10, 96–108.
G.M. Ziegler (1995): Lectures on Polytopes, Graduate Texts in Mathematics 152, Springer-Verlag, New York Berlin Heidelberg.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ziegler, G.M. (1999). Gröbner Bases and Integer Programming. In: Cohen, A.M., Cuypers, H., Sterk, H. (eds) Some Tapas of Computer Algebra. Algorithms and Computation in Mathematics, vol 4. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03891-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-662-03891-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08335-8
Online ISBN: 978-3-662-03891-8
eBook Packages: Springer Book Archive