A Polyhedral Study of Integer Variable Upper Bounds

DOI10.1287/moor.27.4.711.300zbMath1082.90550OpenAlexW2123707302MaRDI QIDQ5704105

Nemhauser, George I., Diego Klabjan

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

integer programmingbranch-and-cutflow cover inequalityinteger variable upper bound

Mathematics Subject Classification ID

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

Related Items (3)

Multi-commodity variable upper bound flow models ⋮ Sequence independent lifting for mixed integer programs with variable upper bounds ⋮ Cover and pack inequalities for (mixed) integer programming

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