Multi-commodity variable upper bound flow models

DOI10.1016/J.DISOPT.2015.05.003MaRDI QIDQ1751124zbMATH OpenOpenAlexFDO

Authors D. L. Burchett, Jean-Philippe 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

cutting planesfacetsliftingvariable upper bounds

Mathematics Subject Classification ID

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

Recommendations

• A polyhedral approach to an integer multicommodity flow problem
• Polyhedral results on single node variable upper-bound flow models with allowed configurations
• A Polyhedral Study of Integer Variable Upper Bounds
• Valid inequalities for problems with additive variable upper bounds
• The projected pairwise multicommodity flow polyhedron

Cites work

• scientific article; zbMATH DE number 53952 (Why is no real title available?)
• A Polyhedral Study of Integer Variable Upper Bounds
• A branch-and-cut algorithm for capacitated network design problems
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
• Lifted flow cover inequalities for mixed 0-1 integer programs
• Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Minimum cost capacity installation for multicommodity network flows
• 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
• Submodularity and valid inequalities in capacitated fixed charge networks
• The 0-1 knapsack problem with a single continuous variable
• The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
• Valid Linear Inequalities for Fixed Charge Problems
• Valid inequalities for problems with additive variable upper bounds

Cited in

(1)

• Online Multi-Commodity Flow with High Demands

Describes a project that uses

Uses Software

• PORTA

This page was built for publication: Multi-commodity variable upper bound flow models

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