Gröbner bases of lattices, corner polyhedra, and integer programming

MaRDI QIDQ1903365zbMATH OpenFDO

Authors 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, http://www.emis.de/journals/BAG/vol.36/no.2/

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

associated idealscorner polyhedraGröbner basesinteger latticespolyhedra

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 1163420
• Cutting corners
• scientific article; zbMATH DE number 2019945
• GRIN: an implementation of Gröbner bases for integer programming
• scientific article; zbMATH DE number 1276818

Cited in

(34)

• 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
• Lattice polytopes from Schur and symmetric Grothendieck polynomials
• 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
• Test sets for vertex cover problems
• Border bases for lattice ideals
• Cellular resolutions of monomial modules
• scientific article; zbMATH DE number 1276818 (Why is no real title available?)
• Computing Gröbner bases of pure binomial ideals via submodules of Z^n
• scientific article; zbMATH DE number 1163420 (Why is no real title available?)
• scientific article; zbMATH DE number 2019945 (Why is no real title available?)
• Standard pairs for lawrence-type matrices and their applications to several lawrence-type integer programs
• Regular decomposition in integer programming
• scientific article; zbMATH DE number 835749 (Why is no real title available?)
• Toric varieties from cyclic matrix semigroups
• GRIN: an implementation of Gröbner bases for integer programming
• Convex Polytopes and Gröbner Bases
• The combinatorics of modeling and analyzing biological systems
• Linear label code of a root lattice using Gröbner bases
• Equivariant lattice bases
• Non-standard approaches to integer programming
• PALP: a package for analysing lattice polytopes with applications to toric geometry
• Computing generating sets of lattice ideals and Markov bases of lattices

This page was built for publication: Gröbner bases of lattices, corner polyhedra, and integer programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1903365)