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
52C07: Lattices and convex bodies in (n) dimensions (aspects of discrete geometry)
52B20: Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry)
90C10: Integer programming
13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
Related Items
Border bases for lattice ideals, Computing Gröbner bases of pure binomial ideals via submodules of \(\mathbb Z^n\), The combinatorics of modeling and analyzing biological systems, Non-standard approaches to integer programming, Computing generating sets of lattice ideals and Markov bases of lattices, 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, Test sets for integer programs, The Hilbert zonotope and a polynomial time algorithm for universal Gröbner bases., The vertex ideal of a lattice., Universal Gröbner basis associated with the maximum flow problem, Fibers of multi-way contingency tables given conditionals: relation to marginals, cell bounds and Markov bases, Minimal generating sets of lattice ideals, Alternatives for testing total dual integrality, Computing the integer programming gap, Computing the algebraic relations of \(C\)-finite sequences and multisequences, On Lawrence semigroups, Unnamed Item
