Lifting, superadditivity, mixed integer rounding and single node flow sets revisited

DOI10.1007/S10288-003-0016-4zbMath1048.90137OpenAlexW2600519231MaRDI QIDQ5907039

Laurence A. Wolsey, Quentin Louveaux

Publication date: 2003

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-003-0016-4

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Combinatorial optimization (90C27)

Related Items (22)

Twelve surveys in operations research ⋮ Lifted Euclidean inequalities for the integer single node flow set with upper bounds ⋮ Lifting two-integer knapsack inequalities ⋮ Robust network design: Formulations, valid inequalities, and computations ⋮ A polyhedral study of the semi-continuous knapsack problem ⋮ Surveys in operations research ⋮ Equivariant perturbation in Gomory and Johnson's infinite group problem (V). Software for the continuous and discontinuous 1-row case ⋮ Lot sizing with inventory gains ⋮ Valid inequalities for the single arc design problem with set-ups ⋮ Polyhedral properties for the intersection of two knapsacks ⋮ Eleven surveys in operations research ⋮ The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs ⋮ Convex hull results for generalizations of the constant capacity single node flow set ⋮ Lifting, superadditivity, mixed integer rounding and single node flow sets revisited ⋮ Weak flow cover inequalities for the capacitated facility location problem ⋮ On cut-based inequalities for capacitated network design polyhedra ⋮ Software for Cut-Generating Functions in the Gomory–Johnson Model and Beyond ⋮ Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs ⋮ A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming ⋮ Polyhedral description of the integer single node flow set with constant bounds ⋮ 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: Lifting, superadditivity, mixed integer rounding and single node flow sets revisited