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

DOI10.1016/j.ejor.2011.10.001zbMath1244.90192MaRDI 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 optimization; branch and bound; heuristic; multi-commodity flow; \(k\)-splittable; dantzig; Wolfe decomposition

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B10: Deterministic network models in operations research

90C27: Combinatorial optimization