Valid inequalities for problems with additive variable upper bounds

DOI10.1007/s101070100235zbMath0995.90068OpenAlexW2617566184MaRDI QIDQ5955566

Atamtürk, Alper, Nemhauser, George I., Savelsbergh, Martin W. P.

Publication date: 27 May 2002

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.3021

zbMATH Keywords

networklinear programmingvalid inequalities

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic network models in operations research (90B10)

Related Items

Implementing Automatic Benders Decomposition in a Modern MIP Solver, A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm, DASH: dynamic approach for switching heuristics, A note on the selection of Benders' cuts, A note on capacity models for network design, Supermodularity and valid inequalities for quadratic optimization with indicators, Multi-commodity variable upper bound flow models, The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs, Lifting, superadditivity, mixed integer rounding and single node flow sets revisited, Sequence independent lifting for mixed integer programs with variable upper bounds, Lifting for mixed integer programs with variable upper bounds

Uses Software

• MINTO