Recently, application of the theory of Gröbner bases to integer programming has given rise to new tools and results in this field. Here we present this algebraic theory as the natural integer analog of the simplex approach to linear programming Although couched in algebra, the theory of Gröbner bases and its consequences for integer programming are intimately intertwined with polyhedral geometry and lattice arithmetic which are staples of the traditional approach to this subject.
CITATION STYLE
Thomas, R. R. (1998). Gröbner Bases in Integer Programming. In Handbook of Combinatorial Optimization (pp. 533–572). Springer US. https://doi.org/10.1007/978-1-4613-0303-9_8
Mendeley helps you to discover research relevant for your work.