Comparing branch-and-price algorithms for the Multi-Commodity k-splittable Maximum Flow Problem-Reference-Cited by-同舟云学术

Comparing branch-and-price algorithms for the Multi-Commodity k-splittable Maximum Flow Problem

Published:2012-03 Issue:2 Volume:217 Page:278-286
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Gamst M.,Petersen B.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference19 articles.

1. F. Alvelos, J.M.V. de Carvalho, Comparing branch-and-price algorithms for the unsplittable multicommodity flow problem, in: International Network Optimization Conference, 2003, pp. 7–12.

2. On the k-splittable flow problem;Baier;Algorithmica,2005

3. Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems;Barnhart;Operations Research,2000

4. An exact approach for the maximum concurrent k-splittable flow problem;Caramia;Optimization Letters,2008

5. A fast heuristic algorithm for the maximum concurrent k-splittable flow problem;Caramia;Optimization Letters,2010

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Mathematical programming models for scheduling multiple cascaded waterway locks;Computers & Industrial Engineering;2021-06

2. A branch and price algorithm to solve the Quickest Multicommodity k-splittable Flow Problem;European Journal of Operational Research;2020-05

3. The multicommodity network flow problem: state of the art classification, applications, and solution methods;Operational Research;2020-04-23

4. A matheuristic approach for the Quickest Multicommodity k-Splittable Flow Problem;Computers & Operations Research;2018-04

5. Service network design models for two-tier city logistics;Optimization Letters;2013-06-18