Advertisement

TOP

, Volume 26, Issue 2, pp 229–232 | Cite as

Comments on: Extensive facility location problems on networks: an updated review

  • Francisco Saldanha-da-Gama
Discussion

Summary

This paper reviews the work published in the past two decades on extensive facility location problems on networks. The authors start by motivating the topic, introducing the type of problems studied in this field of research, and setting the goals for the review. After presenting some notation to be used throughout the paper (Section 2), they revisit some general concepts and aspects of relevance when locating structures on networks (e.g., paths or trees). These include (1) recursive relations often used in a preprocessing phase when solving the problems, (2) the notion of centroid decomposition of a tree, and (3) data structures and properties, namely; top trees, binary trees, spine decomposition, and the nestedness property. Section 4 is fully devoted to the location of paths in a network. The contents are organized according to the type of objective involved in the problem: median, center, center-median, equity, and loss (e.g., in customers satisfaction). In every case, the...

References

  1. Hakimi SL, Labbé M, Schmeichel EF (1999) Locations on time-varying networks. Networks 34:250–257CrossRefGoogle Scholar
  2. Mesa J (1991) Multiperiod medians on networks. RAIRO Recherche Opérationnelle 25:87–95Google Scholar
  3. Mesa J, Boffey B (1996) A review of extensive facility location in networks. Eur J Oper Res 95:592–603CrossRefGoogle Scholar

Copyright information

© Sociedad de Estadística e Investigación Operativa 2018

Authors and Affiliations

  1. 1.Departamento de Estatística e Investigação Operacional, Faculdade de Ciências, Centro de Matemática, Aplicações Fundamentais e Investigação OperacionalUniversidade de LisboaLisbonPortugal

Personalised recommendations