IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v150y2007i1p65-7810.1007-s10479-006-0162-0.html
   My bibliography  Save this article

The location of median paths on grid graphs

Author

Listed:
  • Ronald Becker
  • Isabella Lari
  • Andrea Scozzari
  • Giovanni Storchi

Abstract

In this paper we consider the location of a path shaped facility on a grid graph. In the literature this problem was extensively studied on particular classes of graphs as trees or series-parallel graphs. We consider here the problem of finding a path which minimizes the sum of the (shortest) distances from it to the other vertices of the grid, where the path is also subject to an additional constraint that takes the form either of the length of the path or of the cardinality. We study the complexity of these problems and we find two polynomial time algorithms for two special cases, with time complexity of O(n) and O(nℓ) respectively, where n is the number of vertices of the grid and ℓ is the cardinality of the path to be located. The literature about locating dimensional facilities distinguishes between the location of extensive facilities in continuous spaces and network facility location. We will show that the problems presented here have a close connection with continuous dimensional facility problems, so that the procedures provided can also be useful for solving some open problems of dimensional facilities location in the continuous case. Copyright Springer Science+Business Media, LLC 2007

Suggested Citation

  • Ronald Becker & Isabella Lari & Andrea Scozzari & Giovanni Storchi, 2007. "The location of median paths on grid graphs," Annals of Operations Research, Springer, vol. 150(1), pages 65-78, March.
    • Handle: RePEc:spr:annopr:v:150:y:2007:i:1:p:65-78:10.1007/s10479-006-0162-0
    DOI: 10.1007/s10479-006-0162-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-006-0162-0
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-006-0162-0?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.

    References listed on IDEAS

    as
    1. Diaz-Banez, J. M. & Mesa, J. A., 2001. "Fitting rectilinear polygonal curves to a set of points in the plane," European Journal of Operational Research, Elsevier, vol. 130(1), pages 214-222, April.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Justo Puerto & Federica Ricca & Andrea Scozzari, 2018. "Extensive facility location problems on networks: an updated review," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(2), pages 187-226, July.
    2. Lari, Isabella & Ricca, Federica & Scozzari, Andrea, 2008. "Comparing different metaheuristic approaches for the median path problem with bounded length," European Journal of Operational Research, Elsevier, vol. 190(3), pages 587-597, November.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. J. M. Díaz-Báñez, 2017. "Mathematics and Flamenco: An Unexpected Partnership," The Mathematical Intelligencer, Springer, vol. 39(3), pages 27-39, September.
    2. Diaz-Banez, J. M. & Mesa, J. A. & Schobel, A., 2004. "Continuous location of dimensional structures," European Journal of Operational Research, Elsevier, vol. 152(1), pages 22-44, January.
    3. Ploussard, Quentin, 2024. "Piecewise linear approximation with minimum number of linear segments and minimum error: A fast approach to tighten and warm start the hierarchical mixed integer formulation," European Journal of Operational Research, Elsevier, vol. 315(1), pages 50-62.
    4. Bereg, Sergey & Díaz-Báñez, José-Miguel & Kroher, Nadine & Ventura, Inmaculada, 2019. "Computing melodic templates in oral music traditions," Applied Mathematics and Computation, Elsevier, vol. 344, pages 219-229.

    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:150:y:2007:i:1:p:65-78:10.1007/s10479-006-0162-0. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.