Gröbner bases of lattices, corner polyhedra, and integer programming
From MaRDI portal
Publication:1903365
zbMath0863.90115MaRDI QIDQ1903365
Bernd Sturmfels, Robert Weismantel, Günter M. Ziegler
Publication date: 1 January 1996
Published in: Beiträge zur Algebra und Geometrie (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/223420
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Integer programming (90C10) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items
Computing generating sets of lattice ideals and Markov bases of lattices, Border bases for lattice ideals, Test sets for integer programs, Unnamed Item, Minimal generating sets of lattice ideals, GRIN: An implementation of Gröbner bases for integer programming, Linear label code of a root lattice using Gröbner bases, Universal Gröbner basis associated with the maximum flow problem, Alternatives for testing total dual integrality, The Hilbert zonotope and a polynomial time algorithm for universal Gröbner bases., Computing Gröbner bases of pure binomial ideals via submodules of \(\mathbb Z^n\), Computing the integer programming gap, Toric varieties from cyclic matrix semigroups, Non-standard approaches to integer programming, The combinatorics of modeling and analyzing biological systems, Computing the algebraic relations of \(C\)-finite sequences and multisequences, On Lawrence semigroups, Triple-loop networks with arbitrarily many minimum distance diagrams, On the complexity of smooth projective toric varieties, Standard pairs and group relaxations in integer programming, Test sets of integer programs, The vertex ideal of a lattice., Fibers of multi-way contingency tables given conditionals: relation to marginals, cell bounds and Markov bases
