Multi-commodity variable upper bound flow models

DOI10.1016/j.disopt.2015.05.003zbMath1387.90047OpenAlexW630562403MaRDI QIDQ1751124

D. L. Burchett, Jean-Philippe P. Richard

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2015.05.003

zbMATH Keywords

liftingcutting planesfacetsvariable upper bounds

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)

Uses Software

• PORTA

Cites Work

• Unnamed Item
• The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
• Submodularity and valid inequalities in capacitated fixed charge networks
• Minimum cost capacity installation for multicommodity network flows
• The 0-1 knapsack problem with a single continuous variable
• Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
• Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
• A branch-and-cut algorithm for capacitated network design problems
• On capacitated network design cut-set polyhedra
• Sequence independent lifting for mixed integer programs with variable upper bounds
• On cut-based inequalities for capacitated network design polyhedra
• Valid Linear Inequalities for Fixed Charge Problems
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• A Polyhedral Study of Integer Variable Upper Bounds
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
• Valid inequalities for problems with additive variable upper bounds