Integer multicommodity flow problems

DOI10.1007/3-540-61310-2_5zbMath1415.90132OpenAlexW1480704642MaRDI QIDQ4645913

Pamela H. Vance, Christopher A. Hane, Cynthia Barnhart

Publication date: 11 January 2019

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61310-2_5

zbMATH Keywords

column generationsimple pathmaster problemprice problemshort path problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems ⋮ Unnamed Item ⋮ Algorithms for an integer multicommodity network flow problem with node reliability considerations

Uses Software

• CPLEX
• MINTO
• OSL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• MINTO, a Mixed INTeger Optimizer
• Primal partition programming for block diagonal matrices
• Generalized upper bounding techniques
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Decomposition Principle for Linear Programs