Standard pairs and group relaxations in integer programming

DOI10.1016/S0022-4049(99)00009-2zbMath1010.13016OpenAlexW2020277579WikidataQ114850259 ScholiaQ114850259MaRDI QIDQ1295785

Rekha R. Thomas, Serkan Hoşten

Publication date: 5 May 2003

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-4049(99)00009-2

zbMATH Keywords

integer programmingGröbner basestoric idealsgroup relaxations

Mathematics Subject Classification ID

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Integer programming (90C10) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items

Standard pairs for monomial ideals in semigroup rings, Prime filtrations of monomial ideals and polarizations, An algorithm for solving parametric integer program, On rotational symmetries of drawings of coherent periodic graphs, Finite filtrations of modules and shellable multicomplexes, Asymptotic degree of random monomial ideals, The toric Hilbert scheme of a rank two lattice is smooth and irreducible., Computing the integer programming gap, Initial ideals of unimodular integer programs, An algebraic algorithm for solving parametric integer programs, Uniform bounds on multigraded regularity, Non-standard approaches to integer programming, Standard Bigraded Hilbert Functions, The vertex ideal of a lattice., On a conjecture of R. P. Stanley. II: Quotients modulo monomial ideals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructions and complexity of secondary polytopes
• Linear Diophantine equations and local cohomology
• The Gröbner fan of an ideal
• Computing combinatorial decompositions of rings
• Syzygies of codimension 2 lattice ideals
• Variation of cost functions in integer programming
• The associated primes of initial ideals of lattice ideals
• Gröbner bases of toric varieties
• Bounds on degrees of projective schemes
• Gröbner bases of lattices, corner polyhedra, and integer programming
• Lifting projections of convex polyhedra
• Some polyhedra related to combinatorial problems
• Introduction to Toric Varieties. (AM-131)
• Neighborhood Systems for Production Sets with Indivisibilities
• Sensitivity theorems in integer linear programming
• The value function of an integer program
• On the foundations of linear and integer linear programming I
• What can be computed in algebraic geometry?
• A Geometric Buchberger Algorithm for Integer Programming
• ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
• Extensions of the Group Theoretic Approach in Integer Programming