A Polyhedral Study of Integer Variable Upper Bounds

DOI10.1287/MOOR.27.4.711.300MaRDI QIDQ5704105zbMATH OpenOpenAlexFDO

Authors Diego Klabjan, G. L. Nemhauser

Publication date 11 November 2005

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.27.4.711.300

zbMATH Keywords

branch-and-cutflow cover inequalityinteger programminginteger variable upper bound

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• scientific article; zbMATH DE number 1342120
• Valid inequalities for problems with additive variable upper bounds
• On capacitated network design cut-set polyhedra
• On cut-based inequalities for capacitated network design polyhedra
• Sequence independent lifting for mixed integer programs with variable upper bounds

Cited in

(12)

• Valid inequalities for the single arc design problem with set-ups
• Multi-commodity variable upper bound flow models
• On capacitated network design cut-set polyhedra
• Facets for the single node fixed-charge network set with a node set-up variable
• Polyhedral description of the integer single node flow set with constant bounds
• Sequence independent lifting for mixed integer programs with variable upper bounds
• On cut-based inequalities for capacitated network design polyhedra
• Lifted Euclidean inequalities for the integer single node flow set with upper bounds
• Network design arc set with variable upper bounds
• scientific article; zbMATH DE number 1877233 (Why is no real title available?)
• Fully Bounded Polyhedral Analysis of Integers with Wrapping
• Cover and pack inequalities for (mixed) integer programming

This page was built for publication: A Polyhedral Study of Integer Variable Upper Bounds

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