IDEAS home Printed from https://ideas.repec.org/r/eee/ejores/v85y1995i3p610-624.html
   My bibliography  Save this item

A result on projection for the vehicle routing ptoblem

Citations

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


Cited by:

  1. Fernández, Elena & Roca-Riu, Mireia & Speranza, M. Grazia, 2018. "The Shared Customer Collaboration Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 265(3), pages 1078-1093.
  2. Chrysanthos E. Gounaris & Wolfram Wiesemann & Christodoulos A. Floudas, 2013. "The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty," Operations Research, INFORMS, vol. 61(3), pages 677-693, June.
  3. Manuel Iori & Juan-José Salazar-González & Daniele Vigo, 2007. "An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints," Transportation Science, INFORMS, vol. 41(2), pages 253-264, May.
  4. Tolga Bektaş & Güneş Erdoğan & Stefan Røpke, 2011. "Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem," Transportation Science, INFORMS, vol. 45(3), pages 299-316, August.
  5. Letchford, Adam N. & Salazar-González, Juan-José, 2016. "Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem," European Journal of Operational Research, Elsevier, vol. 251(1), pages 74-84.
  6. Letchford, Adam N. & Salazar-González, Juan-José, 2015. "Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 244(3), pages 730-738.
  7. Taş, Duygu & Gendreau, Michel & Jabali, Ola & Laporte, Gilbert, 2016. "The traveling salesman problem with time-dependent service times," European Journal of Operational Research, Elsevier, vol. 248(2), pages 372-383.
  8. Gizem Ozbaygin & Oya Karasan & Hande Yaman, 2018. "New exact solution approaches for the split delivery vehicle routing problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 85-115, March.
  9. Dollevoet, T.A.B. & Munari, P. & Spliet, R., 2020. "A p-step formulation for the capacitated vehicle routing problem," Econometric Institute Research Papers EI2020-01, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
  10. Roberto Baldacci & Paolo Toth & Daniele Vigo, 2010. "Exact algorithms for routing problems under vehicle capacity constraints," Annals of Operations Research, Springer, vol. 175(1), pages 213-245, March.
  11. Jorge Oyola & Halvard Arntzen & David L. Woodruff, 2018. "The stochastic vehicle routing problem, a literature review, part I: models," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 7(3), pages 193-221, September.
  12. Fernando Afonso Santos & Geraldo Robson Mateus & Alexandre Salles da Cunha, 2015. "A Branch-and-Cut-and-Price Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem," Transportation Science, INFORMS, vol. 49(2), pages 355-368, May.
  13. Archetti, Claudia & Ljubić, Ivana, 2022. "Comparison of formulations for the Inventory Routing Problem," European Journal of Operational Research, Elsevier, vol. 303(3), pages 997-1008.
  14. Rafael Martinelli & Claudio Contardo, 2015. "Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure," INFORMS Journal on Computing, INFORMS, vol. 27(4), pages 658-676, November.
  15. Karaoğlan, İsmail & Erdoğan, Güneş & Koç, Çağrı, 2018. "The Multi-Vehicle Probabilistic Covering Tour Problem," European Journal of Operational Research, Elsevier, vol. 271(1), pages 278-287.
  16. Sandra Ulrich Ngueveu & Christian Prins & Roberto Wolfler Calvo, 2013. "New Lower Bounds and Exact Method for the m -PVRP," Transportation Science, INFORMS, vol. 47(1), pages 38-52, February.
  17. Kellner, Florian & Schneiderbauer, Miriam, 2019. "Further insights into the allocation of greenhouse gas emissions to shipments in road freight transportation: The pollution routing game," European Journal of Operational Research, Elsevier, vol. 278(1), pages 296-313.
  18. Letchford, Adam N. & Salazar-González, Juan-José, 2019. "The Capacitated Vehicle Routing Problem: Stronger bounds in pseudo-polynomial time," European Journal of Operational Research, Elsevier, vol. 272(1), pages 24-31.
  19. Subramanyam, Anirudh & Gounaris, Chrysanthos E., 2016. "A branch-and-cut framework for the consistent traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 248(2), pages 384-395.
  20. Murakami, Keisuke, 2017. "A new model and approach to electric and diesel-powered vehicle routing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 107(C), pages 23-37.
  21. Chiang, Wen-Chyuan & Li, Yuyu & Shang, Jennifer & Urban, Timothy L., 2019. "Impact of drone delivery on sustainability and cost: Realizing the UAV potential through vehicle routing optimization," Applied Energy, Elsevier, vol. 242(C), pages 1164-1175.
  22. R. Baldacci & E. Hadjiconstantinou & A. Mingozzi, 2004. "An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation," Operations Research, INFORMS, vol. 52(5), pages 723-738, October.
  23. Rahma Lahyani & Leandro C. Coelho & Jacques Renaud, 2018. "Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(1), pages 125-157, January.
  24. Leggieri, Valeria & Haouari, Mohamed, 2017. "Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 263(3), pages 755-767.
  25. R. Baldacci & M. Dell'Amico & J. Salazar González, 2007. "The Capacitated m -Ring-Star Problem," Operations Research, INFORMS, vol. 55(6), pages 1147-1162, December.
  26. Daniel Negrotto & Irene Loiseau, 2021. "A Branch & Cut algorithm for the prize-collecting capacitated location routing problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(1), pages 34-57, April.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.