Two- and three-index formulations of the minimum cost multicommodity \(k\)-splittable flow problem

DOI10.1016/j.ejor.2009.05.014zbMath1175.90038OpenAlexW1985363832WikidataQ58826410 ScholiaQ58826410MaRDI QIDQ1038381

David Pisinger, Peter Neergaard Jensen, Mette Gamst, Christian E. M. Plum

Publication date: 17 November 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.05.014

zbMATH Keywords

transportationdecompositionnetwork flowsmulticommodity flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

Related Items

A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem ⋮ Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem ⋮ Comparing branch-and-price algorithms for the multi-commodity \(k\)-splittable maximum flow problem ⋮ A local search heuristic for the multi-commodity \(k\)-splittable maximum flow problem ⋮ A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The shortest path problem with forbidden paths
• A Branch and Price algorithm for the \(k\)-splittable maximum flow problem
• An augmented Lagrangian algorithm for large scale multicommodity routing
• A Suggested Computation for Maximal Multi-Commodity Network Flows
• k -Splittable delay constrained routing problem: A branch-and-price approach
• Decomposition Principle for Linear Programs
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• Approximation and Online Algorithms