Test sets for integer programs
From MaRDI portal
Publication:1365062
DOI10.1007/BF02614324zbMath0887.90124MaRDI QIDQ1365062
Publication date: 28 August 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Related Items
On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond, Solving MIPs via scaling-based augmentation, Combinatorial types of bicyclic polytopes, Short rational generating functions for lattice point problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lattice translates of a polytope and the Frobenius problem
- The complex of maximal lattice free simplices
- Variation of cost functions in integer programming
- Gröbner bases of lattices, corner polyhedra, and integer programming
- Integral Polyhedra in Three Space
- Neighborhood Systems for Production Sets with Indivisibilities
- Production Sets with Indivisibilities, Part I: Generalities
- Production Sets with Indivisibilities, Part II: The Case of Two Activities
- On the foundations of linear and integer linear programming I