Comparing branch-and-price algorithms for the multi-commodity \(k\)-splittable maximum flow problem

DOI10.1016/j.ejor.2011.10.001zbMath1244.90192OpenAlexW1997593628MaRDI QIDQ439370

J. Herrera, H. S. Yoon

Publication date: 16 August 2012

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

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

zbMATH Keywords

combinatorial optimizationbranch and boundheuristicmulti-commodity flow\(k\)-splittabledantzigWolfe decomposition

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (4)

A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem ⋮ A local search heuristic for the multi-commodity \(k\)-splittable maximum flow problem ⋮ Service network design models for two-tier city logistics ⋮ A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem

Cites Work

• The shortest path problem with forbidden paths
• The \(k\)-splittable flow problem
• A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem
• An exact approach for the maximum concurrent \(k\)-splittable flow problem
• A Branch and Price algorithm for the \(k\)-splittable maximum flow problem
• Single-source \(k\)-splittable min-cost flows
• Two- and three-index formulations of the minimum cost multicommodity \(k\)-splittable flow problem
• Minimum-cost single-source 2-splittable flow
• k -Splittable delay constrained routing problem: A branch-and-price approach
• Decomposition Principle for Linear Programs
• Flows on few paths: Algorithms and lower bounds
• Approximation and Online Algorithms

This page was built for publication: Comparing branch-and-price algorithms for the multi-commodity \(k\)-splittable maximum flow problem