Test sets and inequalities for integer programs

DOI10.1007/3-540-61310-2_2MaRDI QIDQ4645910zbMATH OpenOpenAlexFDO

Authors Rekha Thomas, Robert Weismantel

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

zbMATH Keywords

initial idealknapsack constraintregular triangulationfeasible pointcost vector

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Integer programming (90C10)

Recommendations

• Test sets for integer programs
• scientific article; zbMATH DE number 4204116
• Test sets of integer programs
• Cutting planes in integer and mixed integer programming
• Polyhedral approaches to mixed integer linear 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 835749 (Why is no real title available?)
• 0/1-Integer programming: Optimization and Augmentation are equivalent
• A Geometric Buchberger Algorithm for Integer Programming
• Chow polytopes and general resultants
• Constructions and complexity of secondary polytopes
• Fiber polytopes
• Geometric algorithms and combinatorial optimization
• Gröbner bases of toric varieties
• Hilbert Bases and the Facets of Special Knapsack Polytopes
• Standard bases and geometric invariant theory. I: Initial ideals and state polytopes
• The Gröbner fan of an ideal
• Variation of cost functions in integer programming

Cited in

(7)

• Computing generating sets of lattice ideals and Markov bases of lattices
• On the positive sums property and the computation of Graver test sets
• Test sets for integer programs
• scientific article; zbMATH DE number 4204116 (Why is no real title available?)
• Finding multiple solutions in nonlinear integer programming with algebraic test-sets
• On test sets for nonlinear integer maximization
• A simple test for integer programming problems with bounded integer variables

This page was built for publication: Test sets and inequalities for integer programs

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