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

Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems

Citations

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


Cited by:

  1. Cohn, Amy & Davey, Melinda & Schkade, Lisa & Siegel, Amanda & Wong, Caris, 2008. "Network design and flow problems with cross-arc costs," European Journal of Operational Research, Elsevier, vol. 189(3), pages 890-901, September.
  2. Elias Munapo & Santosh Kumar, 2021. "Reducing the complexity of the knapsack linear integer problem by reformulation techniques," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 12(6), pages 1087-1093, December.
  3. Yu Zhou & Leishan Zhou & Yun Wang & Xiaomeng Li & Zhuo Yang, 2017. "A practical model for the train-set utilization: The case of Beijing-Tianjin passenger dedicated line in China," PLOS ONE, Public Library of Science, vol. 12(5), pages 1-24, May.
  4. 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.
  5. Amy Cohn & Sarah Root & Alex Wang & Douglas Mohr, 2007. "Integration of the Load-Matching and Routing Problem with Equipment Balancing for Small Package Carriers," Transportation Science, INFORMS, vol. 41(2), pages 238-252, May.
  6. Chu, James C., 2018. "Mixed-integer programming model and branch-and-price-and-cut algorithm for urban bus network design and timetabling," Transportation Research Part B: Methodological, Elsevier, vol. 108(C), pages 188-216.
  7. Kipp Martin, 2010. "Tutorial: COIN-OR: Software for the OR Community," Interfaces, INFORMS, vol. 40(6), pages 465-476, December.
  8. Fortz, Bernard & Gouveia, Luís & Joyce-Moniz, Martim, 2017. "Models for the piecewise linear unsplittable multicommodity flow problems," European Journal of Operational Research, Elsevier, vol. 261(1), pages 30-42.
  9. Dominique Feillet & Pierre Dejax & Michel Gendreau, 2005. "The Profitable Arc Tour Problem: Solution with a Branch-and-Price Algorithm," Transportation Science, INFORMS, vol. 39(4), pages 539-552, November.
  10. Burak Ayar & Hande Yaman, 2012. "An intermodal multicommodity routing problem with scheduled services," Computational Optimization and Applications, Springer, vol. 53(1), pages 131-153, September.
  11. Line Blander Reinhardt & David Pisinger & Richard Lusby, 2018. "Railway capacity and expansion analysis using time discretized paths," Flexible Services and Manufacturing Journal, Springer, vol. 30(4), pages 712-739, December.
  12. Li, Xiangyong & Ding, Yi & Pan, Kai & Jiang, Dapei & Aneja, Y.P., 2020. "Single-path service network design problem with resource constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
  13. Jinil Han & Kyungsik Lee & Chungmok Lee & Sungsoo Park, 2013. "Exact Algorithms for a Bandwidth Packing Problem with Queueing Delay Guarantees," INFORMS Journal on Computing, INFORMS, vol. 25(3), pages 585-596, August.
  14. Belov, G. & Scheithauer, G., 2006. "A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting," European Journal of Operational Research, Elsevier, vol. 171(1), pages 85-106, May.
  15. 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.
  16. 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.
  17. Baris Yildiz & Martin Savelsbergh, 2019. "Provably High-Quality Solutions for the Meal Delivery Routing Problem," Transportation Science, INFORMS, vol. 53(5), pages 1372-1388, September.
  18. 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.
  19. Mannino, Carlo & Nakkerud, Andreas, 2023. "Optimal Train Rescheduling in Oslo Central Station," Omega, Elsevier, vol. 116(C).
  20. Tian, Xiaopeng & Niu, Huimin, 2020. "Optimization of demand-oriented train timetables under overtaking operations: A surrogate-dual-variable column generation for eliminating indivisibility," Transportation Research Part B: Methodological, Elsevier, vol. 142(C), pages 143-173.
  21. Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
  22. Hela Masri & Saoussen Krichen, 2018. "Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem," Annals of Operations Research, Springer, vol. 267(1), pages 353-377, August.
  23. Naga V. C. Gudapati & Enrico Malaguti & Michele Monaci, 2022. "Network Design with Service Requirements: Scaling-up the Size of Solvable Problems," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2571-2582, September.
  24. Gamvros, Ioannis & Raghavan, S., 2012. "Multi-period traffic routing in satellite networks," European Journal of Operational Research, Elsevier, vol. 219(3), pages 738-750.
  25. Uchoa, Eduardo & Fukasawa, Ricardo & Lysgaard, Jens & Pessoa, Artur & Poggi de Aragão, Marcus & Andrade, Diogo, 2006. "Robust Branch-Cut-and-Price for the Capacitated Minimum Spanning Tree Problem over a Large Extended Formulation," CORAL Working Papers L-2006-08, University of Aarhus, Aarhus School of Business, Department of Business Studies.
  26. Kang, Jangha & Park, Kyungchul & Park, Sungsoo, 2009. "Optimal multicast route packing," European Journal of Operational Research, Elsevier, vol. 196(1), pages 351-359, July.
  27. de Matta, Renato & Peters, Emmanuel, 2009. "Developing work schedules for an inter-city transit system with multiple driver types and fleet types," European Journal of Operational Research, Elsevier, vol. 192(3), pages 852-865, February.
  28. S. Raghavan & Daliborka Stanojević, 2011. "Branch and Price for WDM Optical Networks with No Bifurcation of Flow," INFORMS Journal on Computing, INFORMS, vol. 23(1), pages 56-74, February.
  29. Masri, H. & Krichen, S. & Guitouni, A., 2015. "A multi-start variable neighborhood search for solving the single path multicommodity flow problem," Applied Mathematics and Computation, Elsevier, vol. 251(C), pages 132-142.
  30. Pillac, Victor & Van Hentenryck, Pascal & Even, Caroline, 2016. "A conflict-based path-generation heuristic for evacuation planning," Transportation Research Part B: Methodological, Elsevier, vol. 83(C), pages 136-150.
  31. Chungmok Lee & Kyungsik Lee & Kyungchul Park & Sungsoo Park, 2012. "Technical Note---Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations," Operations Research, INFORMS, vol. 60(3), pages 604-610, June.
  32. Hadi W. Purnomo & Jonathan F. Bard, 2007. "Cyclic preference scheduling for nurses using branch and price," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(2), pages 200-220, March.
  33. Gary Froyland & Stephen J. Maher & Cheng-Lung Wu, 2014. "The Recoverable Robust Tail Assignment Problem," Transportation Science, INFORMS, vol. 48(3), pages 351-372, August.
  34. 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.
  35. Rémy Dupas & Eiichi Taniguchi & Jean-Christophe Deschamps & Ali G. Qureshi, 2020. "A Multi-commodity Network Flow Model for Sustainable Performance Evaluation in City Logistics: Application to the Distribution of Multi-tenant Buildings in Tokyo," Sustainability, MDPI, vol. 12(6), pages 1-18, March.
  36. Vic Grout, 2017. "A Simple Approach to Dynamic Optimisation of Flexible Optical Networks with Practical Application," Future Internet, MDPI, vol. 9(2), pages 1-11, May.
  37. Cortés, Cristián E. & Gendreau, Michel & Rousseau, Louis Martin & Souyris, Sebastián & Weintraub, Andrés, 2014. "Branch-and-price and constraint programming for solving a real-life technician dispatching problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 300-312.
  38. Trivella, Alessio & Corman, Francesco & Koza, David F. & Pisinger, David, 2021. "The multi-commodity network flow problem with soft transit time constraints: Application to liner shipping," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 150(C).
  39. Zhixing Luo & Hu Qin & T. C. E. Cheng & Qinghua Wu & Andrew Lim, 2021. "A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 452-476, May.
  40. Ng, T.S. & Lee, L.H. & Chew, E.P., 2006. "Build-pack planning for hard disk drive assembly with approved vendor matrices and stochastic demands," European Journal of Operational Research, Elsevier, vol. 175(2), pages 1117-1140, December.
  41. 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.
  42. Stefan Irnich & Guy Desaulniers & Jacques Desrosiers & Ahmed Hadjar, 2010. "Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 297-313, May.
  43. 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.
  44. Marie-Claude Côté & Bernard Gendron & Louis-Martin Rousseau, 2013. "Grammar-Based Column Generation for Personalized Multi-Activity Shift Scheduling," INFORMS Journal on Computing, INFORMS, vol. 25(3), pages 461-474, August.
  45. Peeters, M. & Kroon, L.G., 2003. "Circulation of Railway Rolling Stock: A Branch-and-Price Approach," ERIM Report Series Research in Management ERS-2003-055-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.
  46. Ezzati, Sattar & Najafi, Akbar & Yaghini, Masoud & Hashemi, Amir Ala & Bettinger, Pete, 2015. "An optimization model to solve skidding problem in steep slope terrain," Journal of Forest Economics, Elsevier, vol. 21(4), pages 250-268.
  47. Garg, Manish & Smith, J. Cole, 2008. "Models and algorithms for the design of survivable multicommodity flow networks with general failure scenarios," Omega, Elsevier, vol. 36(6), pages 1057-1071, December.
  48. François Lamothe & Emmanuel Rachelson & Alain Haït & Cedric Baudoin & Jean-Baptiste Dupé, 2021. "Randomized rounding algorithms for large scale unsplittable flow problems," Journal of Heuristics, Springer, vol. 27(6), pages 1081-1110, December.
  49. Yao, Yu & Van Woensel, Tom & Veelenturf, Lucas P. & Mo, Pengli, 2021. "The consistent vehicle routing problem considering path consistency in a road network," Transportation Research Part B: Methodological, Elsevier, vol. 153(C), pages 21-44.
  50. Lin, Bo-Liang & Wang, Zhi-Mei & Ji, Li-Jun & Tian, Ya-Ming & Zhou, Guo-Qing, 2012. "Optimizing the freight train connection service network of a large-scale rail system," Transportation Research Part B: Methodological, Elsevier, vol. 46(5), pages 649-667.
  51. 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.
  52. Gamst, M. & Petersen, B., 2012. "Comparing branch-and-price algorithms for the Multi-Commodity k-splittable Maximum Flow Problem," European Journal of Operational Research, Elsevier, vol. 217(2), pages 278-286.
  53. Seohee Kim & Chungmok Lee, 2021. "A branch and price approach for the robust bandwidth packing problem with queuing delays," Annals of Operations Research, Springer, vol. 307(1), pages 251-275, December.
  54. Li, Xiangyong & Aneja, Y.P. & Huo, Jiazhen, 2012. "Using branch-and-price approach to solve the directed network design problem with relays," Omega, Elsevier, vol. 40(5), pages 672-679.
  55. Amy Cohn & Michael Magazine & George Polak, 2009. "Rank‐Cluster‐and‐Prune: An algorithm for generating clusters in complex set partitioning problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(3), pages 215-225, April.
  56. Barış Yıldız & Oya Ekin Karaşan, 2017. "Regenerator Location Problem in Flexible Optical Networks," Operations Research, INFORMS, vol. 65(3), pages 595-620, June.
  57. David R. Morrison & Edward C. Sewell & Sheldon H. Jacobson, 2016. "Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams," INFORMS Journal on Computing, INFORMS, vol. 28(1), pages 67-82, February.
  58. Kim, Junyoung & Goo, Byungju & Roh, Youngjoo & Lee, Chungmok & Lee, Kyungsik, 2023. "A branch-and-price approach for airport gate assignment problem with chance constraints," Transportation Research Part B: Methodological, Elsevier, vol. 168(C), pages 1-26.
  59. Li, Xiangyong & Wei, Kai & Guo, Zhaoxia & Wang, Wei & Aneja, Y.P., 2021. "An exact approach for the service network design problem with heterogeneous resource constraints," Omega, Elsevier, vol. 102(C).
  60. Jayaswal, Sachin & Vidyarthi, Navneet & Das, Sagnik, 2014. "An Efficient Solution Approach for Combinatorial Bandwidth Packing Problem with Queuing Delays," IIMA Working Papers WP2014-12-05, Indian Institute of Management Ahmedabad, Research and Publication Department.
  61. X-Y Li & Y P Aneja & F Baki, 2010. "An ant colony optimization metaheuristic for single-path multicommodity network flow problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(9), pages 1340-1355, September.
  62. Souza, Fernanda S.H. & Gendreau, Michel & Mateus, Geraldo R., 2014. "Branch-and-price algorithm for the Resilient Multi-level Hop-constrained Network Design," European Journal of Operational Research, Elsevier, vol. 233(1), pages 84-93.
  63. 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.
  64. 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.
  65. Esteban Inga & Roberto Hincapié & Sandra Céspedes, 2019. "Capacitated Multicommodity Flow Problem for Heterogeneous Smart Electricity Metering Communications Using Column Generation," Energies, MDPI, vol. 13(1), pages 1-21, December.
  66. Liang Chen & Wei-Kun Chen & Mu-Ming Yang & Yu-Hong Dai, 2021. "An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron," Journal of Global Optimization, Springer, vol. 81(3), pages 659-689, November.
  67. Bita Tadayon & J. Cole Smith, 2014. "Algorithms for an Integer Multicommodity Network Flow Problem with Node Reliability Considerations," Journal of Optimization Theory and Applications, Springer, vol. 161(2), pages 506-532, May.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.