IDEAS home Printed from https://ideas.repec.org/r/inm/oropre/v48y2000i3p461-481.html
   My bibliography  Save this item

A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Rodriguez-Martin, Inmaculada & Salazar-Gonzalez, Juan Jose, 2008. "Solving a capacitated hub location problem," European Journal of Operational Research, Elsevier, vol. 184(2), pages 468-479, January.
  2. Daniel Potthoff & Dennis Huisman & Guy Desaulniers, 2010. "Column Generation with Dynamic Duty Selection for Railway Crew Rescheduling," Transportation Science, INFORMS, vol. 44(4), pages 493-505, November.
  3. Smilowitz, Karen R. & Atamturk, Alper & Daganzo, Carlos F., 2002. "Deferred Item and Vehicle Routing within Integrated Networks," University of California Transportation Center, Working Papers qt0xn2d6kn, University of California Transportation Center.
  4. Jayaraman, Vaidyanathan & Gupta, Rakesh & Pirkul, Hasan, 2003. "Selecting hierarchical facilities in a service-operations environment," European Journal of Operational Research, Elsevier, vol. 147(3), pages 613-628, June.
  5. Ingmar Steinzen & Vitali Gintner & Leena Suhl & Natalia Kliewer, 2010. "A Time-Space Network Approach for the Integrated Vehicle- and Crew-Scheduling Problem with Multiple Depots," Transportation Science, INFORMS, vol. 44(3), pages 367-382, August.
  6. 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.
  7. Bernard Gendron & Luis Gouveia, 2017. "Reformulations by Discretization for Piecewise Linear Integer Multicommodity Network Flow Problems," Transportation Science, INFORMS, vol. 51(2), pages 629-649, May.
  8. Changyong Zhang, 2017. "An origin-based model for unique shortest path routing," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(8), pages 935-951, August.
  9. 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.
  10. Eusebio Angulo & Ricardo García-Ródenas & José Luis Espinosa-Aranda, 2016. "A Lagrangian relaxation approach for expansion of a highway network," Annals of Operations Research, Springer, vol. 246(1), pages 101-126, November.
  11. Gendron, Bernard, 2002. "A note on "a dual-ascent approach to the fixed-charge capacitated network design problem"," European Journal of Operational Research, Elsevier, vol. 138(3), pages 671-675, May.
  12. Stefan Gollowitzer & Bernard Gendron & Ivana Ljubić, 2013. "A cutting plane algorithm for the Capacitated Connected Facility Location Problem," Computational Optimization and Applications, Springer, vol. 55(3), pages 647-674, July.
  13. Ayşegül Altın & Bernard Fortz & Mikkel Thorup & Hakan Ümit, 2013. "Intra-domain traffic engineering with shortest path routing protocols," Annals of Operations Research, Springer, vol. 204(1), pages 65-95, April.
  14. Fausto Errico & Teodor Gabriel Crainic & Federico Malucelli & Maddalena Nonato, 2017. "A Benders Decomposition Approach for the Symmetric TSP with Generalized Latency Arising in the Design of Semiflexible Transit Systems," Transportation Science, INFORMS, vol. 51(2), pages 706-722, May.
  15. 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.
  16. Paraskevopoulos, Dimitris C. & Gürel, Sinan & Bektaş, Tolga, 2016. "The congested multicommodity network design problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 85(C), pages 166-187.
  17. Li, Qing & Liao, Feixiong, 2020. "Incorporating vehicle self-relocations and traveler activity chains in a bi-level model of optimal deployment of shared autonomous vehicles," Transportation Research Part B: Methodological, Elsevier, vol. 140(C), pages 151-175.
  18. 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.
  19. 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.
  20. Ada Alvarez & José González-Velarde & Karim De-Alba, 2005. "Scatter Search for Network Design Problem," Annals of Operations Research, Springer, vol. 138(1), pages 159-178, September.
  21. Silvio Alexandre de Araujo & Bert De Reyck & Zeger Degraeve & Ioannis Fragkos & Raf Jans, 2015. "Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times," INFORMS Journal on Computing, INFORMS, vol. 27(3), pages 431-448, August.
  22. 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.
  23. Sanjay Dominik Jena & Jean-François Cordeau & Bernard Gendron, 2017. "Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 388-404, August.
  24. Holmberg, Kaj & Joborn, Martin & Melin, Kennet, 2008. "Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths," European Journal of Operational Research, Elsevier, vol. 188(1), pages 101-108, July.
  25. Peter Broström & Kaj Holmberg, 2006. "Multiobjective design of survivable IP networks," Annals of Operations Research, Springer, vol. 147(1), pages 235-253, October.
  26. Kaj Holmberg & Di Yuan, 2003. "A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation," INFORMS Journal on Computing, INFORMS, vol. 15(1), pages 42-57, February.
  27. Fangzhou Yan & Huaxin Qiu & Dongya Han, 2023. "Lagrangian Heuristic for Multi-Depot Technician Planning of Product Distribution and Installation with a Lunch Break," Mathematics, MDPI, vol. 11(3), pages 1-22, January.
  28. J Bauer & T Bektaş & T G Crainic, 2010. "Minimizing greenhouse gas emissions in intermodal freight transport: an application to rail service design," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(3), pages 530-542, March.
  29. Saïd Hanafi & Raca Todosijević, 2017. "Mathematical programming based heuristics for the 0–1 MIP: a survey," Journal of Heuristics, Springer, vol. 23(4), pages 165-206, August.
  30. 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.
  31. Ada Suk‐fung Ng & Trilochan Sastry & Janny M.Y. Leung & X.Q. Cai, 2004. "On the uncapacitated K‐commodity network design problem with zero flow‐costs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(8), pages 1149-1172, December.
  32. Zheng, Jianfeng & Meng, Qiang & Sun, Zhuo, 2014. "Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design," European Journal of Operational Research, Elsevier, vol. 234(3), pages 874-884.
  33. Keely L. Croxton & Bernard Gendron & Thomas L. Magnanti, 2007. "Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs," Operations Research, INFORMS, vol. 55(1), pages 146-157, February.
  34. Zheng, Yuchen & Xie, Yujia & Lee, Ilbin & Dehghanian, Amin & Serban, Nicoleta, 2022. "Parallel subgradient algorithm with block dual decomposition for large-scale optimization," European Journal of Operational Research, Elsevier, vol. 299(1), pages 60-74.
  35. Potthoff, D. & Huisman, D. & Desaulniers, G., 2008. "Column generation with dynamic duty selection for railway crew rescheduling," Econometric Institute Research Papers EI 2008-28, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
  36. 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.
  37. Yan, Shangyao & Lin, Jenn-Rong & Lai, Chun-Wei, 2013. "The planning and real-time adjustment of courier routing and scheduling under stochastic travel times and demands," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 53(C), pages 34-48.
  38. Kewcharoenwong, Panitan & Li, Qiaofeng & Üster, Halit, 2023. "Lagrangean relaxation algorithms for fixed-charge capacitated relay network design," Omega, Elsevier, vol. 121(C).
  39. 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.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.