IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v82y1998i0p331-34210.1023-a1018923022243.html
   My bibliography  Save this article

Models for multi-path covering-routing problems

Author

Listed:
  • Brian Boffey
  • Subhash Narula

Abstract

Research on covering has concentrated on problems where the facilities are small inrelation to their cover sets and can justifiably be regarded as points. However, representationby a point is not reasonable for all facilities. In this paper, our objective is to consider pathcovering problems and study them with particular emphasis on multi-path models. We introducea new problem, 2-MPSP, then formulate it and some of its variants. We also outlinetwo solution approaches for solving the 2-MPSP problem. Copyright Kluwer Academic Publishers 1998

Suggested Citation

  • Brian Boffey & Subhash Narula, 1998. "Models for multi-path covering-routing problems," Annals of Operations Research, Springer, vol. 82(0), pages 331-342, August.
    • Handle: RePEc:spr:annopr:v:82:y:1998:i:0:p:331-342:10.1023/a:1018923022243
    DOI: 10.1023/A:1018923022243
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018923022243
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018923022243?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Timothy J. Niblett & Richard L. Church, 2016. "The Shortest Covering Path Problem," International Regional Science Review, , vol. 39(1), pages 131-151, January.
    2. 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.
    3. 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.
    4. Suriyaphong Nilsang & Chumpol Yuangyai & Chen-Yang Cheng & Udom Janjarassuk, 2019. "Locating an ambulance base by using social media: a case study in Bangkok," Annals of Operations Research, Springer, vol. 283(1), pages 497-516, December.
    5. Pablo Adasme & Ali Dehghan Firoozabadi, 2019. "Facility Location with Tree Topology and Radial Distance Constraints," Complexity, Hindawi, vol. 2019, pages 1-29, November.
    6. 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.
    7. 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.
    8. James J. Cochran & Martin S. Levy & Jeffrey D. Camm, 2010. "Bayesian coverage optimization models," Journal of Combinatorial Optimization, Springer, vol. 19(2), pages 158-173, February.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    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:annopr:v:82:y:1998:i:0:p:331-342:10.1023/a:1018923022243. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.