A cutting plane algorithm for the Capacitated Connected Facility Location Problem
Author
Abstract
Suggested Citation
DOI: 10.1007/s10589-013-9544-9
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
- Holmberg, Kaj & Ronnqvist, Mikael & Yuan, Di, 1999. "An exact algorithm for the capacitated facility location problems with single sourcing," European Journal of Operational Research, Elsevier, vol. 113(3), pages 544-559, March.
- F. Sibel Salman & R. Ravi & John N. Hooker, 2008. "Solving the Capacitated Local Access Network Design Problem," INFORMS Journal on Computing, INFORMS, vol. 20(2), pages 243-254, May.
- Alberto Ceselli & Federico Liberatore & Giovanni Righini, 2009. "A computational evaluation of a general branch-and-price framework for capacitated network location problems," Annals of Operations Research, Springer, vol. 167(1), pages 209-251, March.
- Iván Contreras & Juan Díaz, 2008. "Scatter search for the single source capacitated facility location problem," Annals of Operations Research, Springer, vol. 157(1), pages 73-89, January.
- Karen Aardal & Yves Pochet & Laurence A. Wolsey, 1995. "Capacitated Facility Location: Valid Inequalities and Facets," Mathematics of Operations Research, INFORMS, vol. 20(3), pages 562-582, August.
- Ilfat Ghamlouche & Teodor Crainic & Michel Gendreau, 2004. "Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design," Annals of Operations Research, Springer, vol. 131(1), pages 109-133, October.
- Kaj Holmberg & Di Yuan, 2000. "A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem," Operations Research, INFORMS, vol. 48(3), pages 461-481, June.
- Aardal, K. & Pochet, Y. & Wolsey, L. A., 1995. "Capacitated facility location: valid inequalities and facets," LIDAM Reprints CORE 1295, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Teodor Gabriel Crainic & Michel Gendreau & Judith M. Farvolden, 2000. "A Simplex-Based Tabu Search Method for Capacitated Network Design," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 223-236, August.
- Alysson Costa & Jean-François Cordeau & Bernard Gendron, 2009. "Benders, metric and cutset inequalities for multicommodity capacitated network design," Computational Optimization and Applications, Springer, vol. 42(3), pages 371-392, April.
- Mike Hewitt & George L. Nemhauser & Martin W. P. Savelsbergh, 2010. "Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 314-325, May.
- M. Gisela Bardossy & S. Raghavan, 2010. "Dual-Based Local Search for the Connected Facility Location and Related Problems," INFORMS Journal on Computing, INFORMS, vol. 22(4), pages 584-602, November.
- Ilfat Ghamlouche & Teodor Gabriel Crainic & Michel Gendreau, 2003. "Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design," Operations Research, INFORMS, vol. 51(4), pages 655-667, August.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Ortiz-Astorquiza, Camilo & Contreras, Ivan & Laporte, Gilbert, 2018. "Multi-level facility location problems," European Journal of Operational Research, Elsevier, vol. 267(3), pages 791-805.
- Markus Leitner & Ivana Ljubić & Markus Sinnl, 2015. "A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 118-134, February.
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.- Mervat Chouman & Teodor Gabriel Crainic & Bernard Gendron, 2018. "The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 143-184, June.
- Mervat Chouman & Teodor Gabriel Crainic & Bernard Gendron, 2017. "Commodity Representations and Cut-Set-Based Inequalities for Multicommodity Capacitated Fixed-Charge Network Design," Transportation Science, INFORMS, vol. 51(2), pages 650-667, May.
- Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar & Mohammad Hassan Sharifitabar, 2015. "A Cutting-Plane Neighborhood Structure for Fixed-Charge Capacitated Multicommodity Network Design Problem," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 48-58, February.
- Gendron, Bernard & Hanafi, Saïd & Todosijević, Raca, 2018. "Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design," European Journal of Operational Research, Elsevier, vol. 268(1), pages 70-81.
- Agarwal, Y.K. & Aneja, Y.P. & Jayaswal, Sachin, 2022. "Directed fixed charge multicommodity network design: A cutting plane approach using polar duality," European Journal of Operational Research, Elsevier, vol. 299(1), pages 118-136.
- Li, Xiangyong & Wei, Kai & Aneja, Y.P. & Tian, Peng, 2017. "Design-balanced capacitated multicommodity network design with heterogeneous assets," Omega, Elsevier, vol. 67(C), pages 145-159.
- Mike Hewitt & George Nemhauser & Martin W. P. Savelsbergh, 2013. "Branch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 302-316, May.
- Tobias Harks & Felix G. König & Jannik Matuschke & Alexander T. Richter & Jens Schulz, 2016. "An Integrated Approach to Tactical Transportation Planning in Logistics Networks," Transportation Science, INFORMS, vol. 50(2), pages 439-460, May.
- Alan Erera & Michael Hewitt & Martin Savelsbergh & Yang Zhang, 2013. "Improved Load Plan Design Through Integer Programming Based Local Search," Transportation Science, INFORMS, vol. 47(3), pages 412-427, August.
- Dayarian, Iman & Rocco, Adolfo & Erera, Alan & Savelsbergh, Martin, 2022. "Operations design for high-velocity intra-city package service," Transportation Research Part B: Methodological, Elsevier, vol. 161(C), pages 150-168.
- Ahmad I. Jarrah & Ellis Johnson & Lucas C. Neubert, 2009. "Large-Scale, Less-than-Truckload Service Network Design," Operations Research, INFORMS, vol. 57(3), pages 609-625, June.
- Mike Hewitt & George L. Nemhauser & Martin W. P. Savelsbergh, 2010. "Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 314-325, May.
- SteadieSeifi, M. & Dellaert, N.P. & Nuijten, W. & Van Woensel, T., 2017. "A metaheuristic for the multimodal network flow problem with product quality preservation and empty repositioning," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 321-344.
- Fragkos, Ioannis & Cordeau, Jean-François & Jans, Raf, 2021. "Decomposition methods for large-scale network expansion problems," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 60-80.
- Ahmad Baubaid & Natashia Boland & Martin Savelsbergh, 2021. "The Value of Limited Flexibility in Service Network Designs," Transportation Science, INFORMS, vol. 55(1), pages 52-74, 1-2.
- Endong Zhu & Teodor Gabriel Crainic & Michel Gendreau, 2014. "Scheduled Service Network Design for Freight Rail Transportation," Operations Research, INFORMS, vol. 62(2), pages 383-400, April.
- Bai, Ruibin & Wallace, Stein W. & Li, Jingpeng & Chong, Alain Yee-Loong, 2014. "Stochastic service network design with rerouting," Transportation Research Part B: Methodological, Elsevier, vol. 60(C), pages 50-65.
- 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.
- Zhi-Hai Zhang & Gemma Berenguer & Zuo-Jun (Max) Shen, 2015. "A Capacitated Facility Location Model with Bidirectional Flows," Transportation Science, INFORMS, vol. 49(1), pages 114-129, February.
- Natashia Boland & Mike Hewitt & Luke Marshall & Martin Savelsbergh, 2017. "The Continuous-Time Service Network Design Problem," Operations Research, INFORMS, vol. 65(5), pages 1303-1321, October.
More about this item
Keywords
Capacitated network design; Facility Location; Connected Facility Location; Mixed integer programming models; Telecommunications;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:spr:coopap:v:55:y:2013:i:3:p:647-674. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.