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

DOI10.1016/J.EJOR.2011.10.001MaRDI QIDQ439370zbMATH OpenOpenAlexFDO

Authors M. Gamst, B. Petersen

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

\(k\)-splittablebranch and boundcombinatorial optimizationdantzigheuristicmulti-commodity flowWolfe decomposition

Mathematics Subject Classification ID

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

Recommendations

• 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
• An exact approach for the maximum concurrent \(k\)-splittable flow problem
• Two- and three-index formulations of the minimum cost multicommodity k-splittable flow problem
• A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem

Cites work

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

Cited in

(9)

• Two- and three-index formulations of the minimum cost multicommodity k-splittable flow problem
• A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem
• A branch and price algorithm to solve 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
• K-splittable delay constrained routing problem: A branch-and-price approach
• 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

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

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