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

The maximum covering/shortest path problem: A multiobjective network design and routing formulation

Citations

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


Cited by:

  1. S. A. MirHassani & R. Ebrazi, 2013. "A Flexible Reformulation of the Refueling Station Location Problem," Transportation Science, INFORMS, vol. 47(4), pages 617-628, November.
  2. Beheshtian, Arash & Donaghy, Kieran P. & Richard Geddes, R. & Oliver Gao, H., 2018. "Climate-adaptive planning for the long-term resilience of transportation energy infrastructure," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 113(C), pages 99-122.
  3. Timothy J. Niblett & Richard L. Church, 2016. "The Shortest Covering Path Problem," International Regional Science Review, , vol. 39(1), pages 131-151, January.
  4. J. Beasley & E. Nascimento, 1996. "The Vehicle Routing-Allocation Problem: A unifying framework," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 4(1), pages 65-86, June.
  5. Alan T. Murray, 2016. "Maximal Coverage Location Problem," International Regional Science Review, , vol. 39(1), pages 5-27, January.
  6. Jenkins, Phillip R. & Lunday, Brian J. & Robbins, Matthew J., 2020. "Robust, multi-objective optimization for the military medical evacuation location-allocation problem," Omega, Elsevier, vol. 97(C).
  7. Richard Church & John Current, 1993. "Maximal covering tree problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(1), pages 129-142, February.
  8. 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.
  9. Russell Halper & S. Raghavan, 2011. "The Mobile Facility Routing Problem," Transportation Science, INFORMS, vol. 45(3), pages 413-434, August.
  10. Zhao, Jiangjiang & Ma, Tieju, 2016. "Optimizing layouts of initial AFV refueling stations targeting different drivers, and experiments with agent-based simulations," European Journal of Operational Research, Elsevier, vol. 249(2), pages 706-716.
  11. Bapna, Ravi & Thakur, Lakshman S. & Nair, Suresh K., 2002. "Infrastructure development for conversion to environmentally friendly fuel," European Journal of Operational Research, Elsevier, vol. 142(3), pages 480-496, November.
  12. Curtin, Kevin M. & Biba, Steve, 2011. "The Transit Route Arc-Node Service Maximization problem," European Journal of Operational Research, Elsevier, vol. 208(1), pages 46-56, January.
  13. Amin Akbari & Ronald Pelot & H. A. Eiselt, 2018. "A modular capacitated multi-objective model for locating maritime search and rescue vessels," Annals of Operations Research, Springer, vol. 267(1), pages 3-28, August.
  14. Danwen Bao & Shijia Tian & Rui Li & Tianxuan Zhang & Ting Zhu, 2022. "Multi-Objective Decision Method for Airport Landside Rapid Transit Network Design," Networks and Spatial Economics, Springer, vol. 22(4), pages 767-801, December.
  15. Mesa, Juan A. & Brian Boffey, T., 1996. "A review of extensive facility location in networks," European Journal of Operational Research, Elsevier, vol. 95(3), pages 592-603, December.
  16. Yu Nie & Xing Wu & Tito Homem-de-Mello, 2012. "Optimal Path Problems with Second-Order Stochastic Dominance Constraints," Networks and Spatial Economics, Springer, vol. 12(4), pages 561-587, December.
  17. Kamruzzaman, Md. & Hine, Julian & Gunay, Banihan & Blair, Neale, 2011. "Using GIS to visualise and evaluate student travel behaviour," Journal of Transport Geography, Elsevier, vol. 19(1), pages 13-32.
  18. Sam Ratick & Jeffrey Osleeb & Kangping Si, 2016. "The Maximal Cover Location Model with Hedging," International Regional Science Review, , vol. 39(1), pages 77-107, January.
  19. Lei, Chao & Lin, Wei-Hua & Miao, Lixin, 2014. "A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 238(3), pages 699-710.
  20. Ramon Auad & Rajan Batta, 2017. "Location-coverage models for preventing attacks on interurban transportation networks," Annals of Operations Research, Springer, vol. 258(2), pages 679-717, November.
  21. Myung, Young-Soo & Kim, Hu-gon & Tcha, Dong-wan, 1997. "A bi-objective uncapacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 100(3), pages 608-616, August.
  22. Avella, P. & Benati, S. & Canovas Martinez, L. & Dalby, K. & Di Girolamo, D. & Dimitrijevic, B. & Ghiani, G. & Giannikos, I. & Guttmann, N. & Hultberg, T. H. & Fliege, J. & Marin, A. & Munoz Marquez, , 1998. "Some personal views on the current state and the future of locational analysis," European Journal of Operational Research, Elsevier, vol. 104(2), pages 269-287, January.
  23. Roy, Sandeepan & Maji, Avijit, 2019. "A Station Location Identification Model for an Integrated Interoperable High-Speed Rail System," ADBI Working Papers 956, Asian Development Bank Institute.
  24. Matisziw, Timothy C. & Murray, Alan T. & Kim, Changjoo, 2006. "Strategic route extension in transit networks," European Journal of Operational Research, Elsevier, vol. 171(2), pages 661-673, June.
  25. Bruno, Giuseppe & Ghiani, Gianpaolo & Improta, Gennaro, 1998. "A multi-modal approach to the location of a rapid transit line," European Journal of Operational Research, Elsevier, vol. 104(2), pages 321-332, January.
  26. Leo Bont & Hans Heinimann & Richard Church, 2015. "Concurrent optimization of harvesting and road network layouts under steep terrain," Annals of Operations Research, Springer, vol. 232(1), pages 41-64, September.
  27. Murawski, Lisa & Church, Richard L., 2009. "Improving accessibility to rural health services: The maximal covering network improvement problem," Socio-Economic Planning Sciences, Elsevier, vol. 43(2), pages 102-110, June.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.