Gröbner bases and integer programming
For the review of the entire collection see Zbl 0924.13021. It has been realized recently by \textit{P. Conti} and \textit{C. Traverso} [in: Applied algebra, algebraic algorithms and error-correcting codes, Proc. 9th Int. Symp., AAECC-9, New Orleans/LA (USA) 1991, Lect. Notes Comput. Sci. 539, 130-139 (1991; Zbl 0771.13014)] that the Buchberger algorithm provides a solution strategy for integer programming problems. The author shows how, in the special case of the binomial ideals that arise from integer programs, the Buchberger algorithm can be formulated as a combinatorial-geometric algorithm that operates on lattice vectors. Moreover he presents a surprisingly simple variation of the Buchberger algorithm for integer programming. For the entire collection see [Zbl 0924.13021].
- scientific article; zbMATH DE number 1163420
- scientific article; zbMATH DE number 2019945
- scientific article; zbMATH DE number 1163421
- Truncated Gröbner bases for integer programming
- Computation of Gröbner bases
- Gröbner bases of lattices, corner polyhedra, and integer programming
- scientific article; zbMATH DE number 3941661
- Gröbner bases: Strategies and applications
- A new framework for computing Gröbner bases
- Truncated Gröbner bases for integer programming
- Modular algorithms for computing Gröbner bases.
- Gröbner bases of lattices, corner polyhedra, and integer programming
- Gröbner basis approach to some combinatorial problems
- Another pedagogy for pure-integer Gomory
- A Variant of the Buchberger Algorithm for Integer Programming
- Buchberger algorithm and integer programming
- scientific article; zbMATH DE number 1163421 (Why is no real title available?)
- scientific article; zbMATH DE number 2019945 (Why is no real title available?)
- scientific article; zbMATH DE number 2102751 (Why is no real title available?)
- A Geometric Buchberger Algorithm for Integer Programming
- An integer programming algorithm based on Groebner basis of signature
- GRIN: an implementation of Gröbner bases for integer programming
- On FGLM algorithms with tropical Gröbner bases
- scientific article; zbMATH DE number 5192687 (Why is no real title available?)
- Counting and Gröbner bases
- On computing Hilbert bases via the Elliot--MacMahon algorithm
- Artificial discontinuities of single-parametric Gröbner bases
This page was built for publication: Gröbner bases and integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4238963)
