Comparing branch-and-price algorithms for the Multi-Commodity k-splittable Maximum Flow Problem
Author
Abstract
Suggested Citation
DOI: 10.1016/j.ejor.2011.10.001
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Cynthia Barnhart & Christopher A. Hane & Pamela H. Vance, 2000. "Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems," Operations Research, INFORMS, vol. 48(2), pages 318-326, April.
- Gamst, Mette & Neergaard Jensen, Peter & Pisinger, David & Plum, Christian, 2010. "Two- and three-index formulations of the minimum cost multicommodity k-splittable flow problem," European Journal of Operational Research, Elsevier, vol. 202(1), pages 82-89, April.
- Villeneuve, Daniel & Desaulniers, Guy, 2005. "The shortest path problem with forbidden paths," European Journal of Operational Research, Elsevier, vol. 165(1), pages 97-107, August.
- George B. Dantzig & Philip Wolfe, 1960. "Decomposition Principle for Linear Programs," Operations Research, INFORMS, vol. 8(1), pages 101-111, February.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Melchiori, Anna & Sgalambro, Antonino, 2020. "A branch and price algorithm to solve the Quickest Multicommodity k-splittable Flow Problem," European Journal of Operational Research, Elsevier, vol. 282(3), pages 846-857.
- Khodakaram Salimifard & Sara Bigharaz, 2022. "The multicommodity network flow problem: state of the art classification, applications, and solution methods," Operational Research, Springer, vol. 22(1), pages 1-47, March.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Melchiori, Anna & Sgalambro, Antonino, 2020. "A branch and price algorithm to solve the Quickest Multicommodity k-splittable Flow Problem," European Journal of Operational Research, Elsevier, vol. 282(3), pages 846-857.
- Gamst, Mette & Neergaard Jensen, Peter & Pisinger, David & Plum, Christian, 2010. "Two- and three-index formulations of the minimum cost multicommodity k-splittable flow problem," European Journal of Operational Research, Elsevier, vol. 202(1), pages 82-89, April.
- Khodakaram Salimifard & Sara Bigharaz, 2022. "The multicommodity network flow problem: state of the art classification, applications, and solution methods," Operational Research, Springer, vol. 22(1), pages 1-47, March.
- Albert H. Schrotenboer & Evrim Ursavas & Iris F. A. Vis, 2019. "A Branch-and-Price-and-Cut Algorithm for Resource-Constrained Pickup and Delivery Problems," Transportation Science, INFORMS, vol. 53(4), pages 1001-1022, July.
- Ashwin Arulselvan & Mohsen Rezapour, 2017. "Exact Approaches for Designing Multifacility Buy-at-Bulk Networks," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 597-611, November.
- Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
- Jie, Wanchen & Yang, Jun & Zhang, Min & Huang, Yongxi, 2019. "The two-echelon capacitated electric vehicle routing problem with battery swapping stations: Formulation and efficient methodology," European Journal of Operational Research, Elsevier, vol. 272(3), pages 879-904.
- Gendreau, Michel & Manerba, Daniele & Mansini, Renata, 2016. "The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach," European Journal of Operational Research, Elsevier, vol. 248(1), pages 59-71.
- Seyed Hossein Hashemi Doulabi & Louis-Martin Rousseau & Gilles Pesant, 2016. "A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 432-448, August.
- Ahmadi-Javid, Amir & Amiri, Elahe & Meskar, Mahla, 2018. "A Profit-Maximization Location-Routing-Pricing Problem: A Branch-and-Price Algorithm," European Journal of Operational Research, Elsevier, vol. 271(3), pages 866-881.
- Paul A. Chircop & Timothy J. Surendonk & Menkes H. L. van den Briel & Toby Walsh, 2022. "On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage," Annals of Operations Research, Springer, vol. 312(2), pages 723-760, May.
- Guy Desaulniers, 2010. "Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows," Operations Research, INFORMS, vol. 58(1), pages 179-192, February.
- Lienkamp, Benedikt & Schiffer, Maximilian, 2024. "Column generation for solving large scale multi-commodity flow problems for passenger transportation," European Journal of Operational Research, Elsevier, vol. 314(2), pages 703-717.
- Wu, Lingxiao & Wang, Shuaian & Laporte, Gilbert, 2021. "The Robust Bulk Ship Routing Problem with Batched Cargo Selection," Transportation Research Part B: Methodological, Elsevier, vol. 143(C), pages 124-159.
- Degraeve, Z. & Jans, R.F., 2003. "A New Dantzig-Wolfe Reformulation And Branch-And-Price Algorithm For The Capacitated Lot Sizing Problem With Set Up Times," ERIM Report Series Research in Management ERS-2003-010-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
- Yao, Zhiyuan & Nie, Lei & Fu, Huiling, 2024. "Railway line planning with passenger routing: Direct-service network representations and a two-phase solution approach," Transportation Research Part B: Methodological, Elsevier, vol. 186(C).
- Adil Tahir & Guy Desaulniers & Issmail El Hallaoui, 2019. "Integral column generation for the set partitioning problem," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(5), pages 713-744, December.
- Zhixing Luo & Hu Qin & Wenbin Zhu & Andrew Lim, 2017. "Branch and Price and Cut for the Split-Delivery Vehicle Routing Problem with Time Windows and Linear Weight-Related Cost," Transportation Science, INFORMS, vol. 51(2), pages 668-687, May.
- Jans, Raf, 2010. "Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems," European Journal of Operational Research, Elsevier, vol. 204(2), pages 251-254, July.
- Daniel Villeneuve & Jacques Desrosiers & Marco Lübbecke & François Soumis, 2005. "On Compact Formulations for Integer Programs Solved by Column Generation," Annals of Operations Research, Springer, vol. 139(1), pages 375-388, October.
More about this item
Keywords
Branch and bound; Combinatorial optimization; Multi-commodity flow; k-Splittable; Dantzig–Wolfe decomposition; Heuristic;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:217:y:2012:i:2:p:278-286. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.