Test sets and inequalities for integer programs
From MaRDI portal
Publication:4645910
DOI10.1007/3-540-61310-2_2zbMath1415.90067OpenAlexW1886746049MaRDI QIDQ4645910
Robert Weismantel, Rekha R. Thomas
Publication date: 11 January 2019
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61310-2_2
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructions and complexity of secondary polytopes
- The Gröbner fan of an ideal
- Standard bases and geometric invariant theory. I: Initial ideals and state polytopes
- Chow polytopes and general resultants
- Fiber polytopes
- Geometric algorithms and combinatorial optimization
- Variation of cost functions in integer programming
- Gröbner bases of toric varieties
- Hilbert Bases and the Facets of Special Knapsack Polytopes
- A Geometric Buchberger Algorithm for Integer Programming
- 0/1-Integer programming: Optimization and Augmentation are equivalent