Standard pairs and group relaxations in integer programming
From MaRDI portal
(Redirected from Publication:1295785)
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
Cites work
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 177867 (Why is no real title available?)
- scientific article; zbMATH DE number 575960 (Why is no real title available?)
- scientific article; zbMATH DE number 638938 (Why is no real title available?)
- scientific article; zbMATH DE number 967945 (Why is no real title available?)
- A Geometric Buchberger Algorithm for Integer Programming
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- Bounds on degrees of projective schemes
- Computing combinatorial decompositions of rings
- Constructions and complexity of secondary polytopes
- Extensions of the Group Theoretic Approach in Integer Programming
- Gröbner bases of lattices, corner polyhedra, and integer programming
- Gröbner bases of toric varieties
- Introduction to Toric Varieties. (AM-131)
- Lifting projections of convex polyhedra
- Linear Diophantine equations and local cohomology
- Neighborhood Systems for Production Sets with Indivisibilities
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
- On the foundations of linear and integer linear programming I
- Sensitivity theorems in integer linear programming
- Some polyhedra related to combinatorial problems
- Syzygies of codimension 2 lattice ideals
- The Gröbner fan of an ideal
- The associated primes of initial ideals of lattice ideals
- The value function of an integer program
- Variation of cost functions in integer programming
- What can be computed in algebraic geometry?
Cited in
(18)- Standard pairs for lawrence-type matrices and their applications to several lawrence-type integer programs
- Standard pairs for monomial ideals in semigroup rings
- On a conjecture of R. P. Stanley. II: Quotients modulo monomial ideals
- The structure of group relaxations
- Computing the integer programming gap
- The vertex ideal of a lattice.
- An algebraic algorithm for solving parametric integer programs
- scientific article; zbMATH DE number 1736031 (Why is no real title available?)
- Uniform bounds on multigraded regularity
- Finite filtrations of modules and shellable multicomplexes
- The toric Hilbert scheme of a rank two lattice is smooth and irreducible.
- Initial ideals of unimodular integer programs
- An algorithm for solving parametric integer program
- Standard Bigraded Hilbert Functions
- On rotational symmetries of drawings of coherent periodic graphs
- Prime filtrations of monomial ideals and polarizations
- Asymptotic degree of random monomial ideals
- Non-standard approaches to integer programming
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)
