Standard pairs and group relaxations in integer programming

DOI10.1016/S0022-4049(99)00009-2zbMATH Open1010.13016OpenAlexW2020277579WikidataQ114850259 ScholiaQ114850259MaRDI QIDQ1295785FDOQ1295785

Authors: Serkan Hoşten, Rekha Thomas 

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

Recommendations

• Alternative group relaxation of integer programming problems
• The group problem and integer programming duality
• The group-theoretic approach in mixed integer programming
• Group-theoretic method of decomposition methods in integer linear programming
• Relation betwen integer linear vector optimization and multicriteria problems on groups and graphs
• scientific article; zbMATH DE number 4092675
• On the complexity of surrogate and group relaxation for integer linear programs
• Standard pairs for lawrence-type matrices and their applications to several lawrence-type integer programs
• Constrained infinite group relaxations of MIPs
• Semidefinite relaxations for integer programming

zbMATH Keywords

[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Gr%EF%BF%BD%EF%BF%BDbner+bases&go=Go Gr��bner bases]integer programmingtoric idealsgroup relaxations

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (18)

• Standard pairs for lawrence-type matrices and their applications to several lawrence-type integer programs
• Non-standard approaches to integer programming
• Uniform bounds on multigraded regularity
• On a conjecture of R. P. Stanley. II: Quotients modulo monomial ideals
• The toric Hilbert scheme of a rank two lattice is smooth and irreducible.
• Standard pairs for monomial ideals in semigroup rings
• Asymptotic degree of random monomial ideals
• Computing the integer programming gap
• An algebraic algorithm for solving parametric integer programs
• 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
• Initial ideals of unimodular integer programs
• The vertex ideal of a lattice.
• Title not available (Why is that?)
• Standard Bigraded Hilbert Functions
• The structure of group relaxations

This page was built for publication: Standard pairs and group relaxations in integer programming

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