Gröbner bases and integer programming (Q4238963)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1276818
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Gröbner bases and integer programming |
scientific article; zbMATH DE number 1276818 |
Statements
20 April 1999
0 references
Gröbner bases
0 references
integer programming
0 references
Buchberger algorithm
0 references
binomial ideals
0 references
0.93667525
0 references
0 references
0.92394626
0 references
0.9205426
0 references
0.9200704
0 references
Gröbner bases and integer programming (English)
0 references
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].
0 references