Test sets of integer programs
From MaRDI portal
Publication:1298753
DOI10.1007/BF01193834zbMath0927.90086MaRDI QIDQ1298753
Publication date: 22 August 1999
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
surveyreduced Gröbner basisminimum cost flowknapsackaugmentation problemmatroid optimizationGraver test set
Related Items
A class of integer linear fractional bilevel programming problems, Universal Gröbner basis associated with the maximum flow problem, On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming, Optimality criterion for a class of nonlinear integer programs., Cone superadditivity of discrete convex functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Total dual integrality and integer polyhedra
- An integer analogue of Carathéodory's theorem
- Scaling algorithms for network problems
- An application of simultaneous diophantine approximation in combinatorial optimization
- Covering minima and lattice-point-free convex bodies
- Geometric algorithms and combinatorial optimization
- Truncated Gröbner bases for integer programming
- Variation of cost functions in integer programming
- Gröbner bases of lattices, corner polyhedra, and integer programming
- A Variant of the Buchberger Algorithm for Integer Programming
- The Shapes of Polyhedra
- Neighborhood Systems for Production Sets with Indivisibilities
- Minkowski's Convex Body Theorem and Integer Programming
- Production Sets with Indivisibilities, Part I: Generalities
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- On the foundations of linear and integer linear programming I
- A Geometric Buchberger Algorithm for Integer Programming
