Test sets of integer programs

DOI10.1007/BF01193834MaRDI QIDQ1298753zbMATH OpenFDO

Authors Robert Weismantel

Publication date 22 August 1999

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

zbMATH Keywords

surveyminimum cost flowknapsack[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=reduced+Gr%EF%BF%BD%EF%BF%BDbner+basis&go=Go reduced Gr��bner basis]augmentation problemmatroid optimizationGraver test set

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• On the positive sums property and the computation of Graver test sets
• Test sets for integer programs
• A Geometric Buchberger Algorithm for Integer Programming
• scientific article; zbMATH DE number 2152474

Cites work

• scientific article; zbMATH DE number 4027489 (Why is no real title available?)
• 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 3534506 (Why is no real title available?)
• scientific article; zbMATH DE number 1263256 (Why is no real title available?)
• scientific article; zbMATH DE number 3001142 (Why is no real title available?)
• scientific article; zbMATH DE number 217454 (Why is no real title available?)
• scientific article; zbMATH DE number 863497 (Why is no real title available?)
• A Geometric Buchberger Algorithm for Integer Programming
• A Variant of the Buchberger Algorithm for Integer Programming
• An application of simultaneous diophantine approximation in combinatorial optimization
• An integer analogue of Carathéodory's theorem
• Covering minima and lattice-point-free convex bodies
• Geometric algorithms and combinatorial optimization
• Gröbner bases of lattices, corner polyhedra, and integer programming
• Minkowski's Convex Body Theorem and Integer Programming
• Neighborhood Systems for Production Sets with Indivisibilities
• On the foundations of linear and integer linear programming I
• Production Sets with Indivisibilities, Part I: Generalities
• Scaling algorithms for network problems
• The Shapes of Polyhedra
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Total dual integrality and integer polyhedra
• Truncated Gröbner bases for integer programming
• Variation of cost functions in integer programming

Cited in

(13)

• On the relative complexity of 15 problems related to~0/1-integer programming
• Optimality criterion for a class of nonlinear integer programs.
• On the positive sums property and the computation of Graver test sets
• Universal Gröbner basis associated with the maximum flow problem
• Finiteness theorems in stochastic integer programming
• Test sets of the knapsack problem and simultaneous Diophantine approximation
• A class of integer linear fractional bilevel programming problems
• Test sets and inequalities for integer programs
• Decomposition of test sets in stochastic integer programming
• Test sets for integer programs
• scientific article; zbMATH DE number 4204116 (Why is no real title available?)
• Cone superadditivity of discrete convex functions
• Finding multiple solutions in nonlinear integer programming with algebraic test-sets

Describes a project that uses

Uses Software

• GRIN

This page was built for publication: Test sets of integer programs

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