TOP

pp 1–2 | Cite as

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

Discussion
  • 4 Downloads

References

  1. Kincaid R, Lowe T, Morin T (1988) The location of central structures in trees. Comput Oper Res 15(2):103–111CrossRefGoogle Scholar
  2. Kim T, Lowe T, Ward J, Francis R (1989) A minimum length covering subgraph of a network. Ann Oper Res 18:245–260CrossRefGoogle Scholar
  3. Kim T, Lowe T, Ward J, Francis R (1990) A minimum-length covering subtree of a tree. Nav Res Logist 37:309–326CrossRefGoogle Scholar
  4. Kim T, Lowe T, Tamir A, Ward J (1996) On the location of a tree-shaped facility. Networks 28:167–175CrossRefGoogle Scholar
  5. Spoerhase J (2010) An optimal algorithm for the indirect covering subtree problem. arXiv:1002.0580v1
  6. Schmidt M, Schöbel A (2014) Location of speed-up subnetworks. Ann Oper Res 223(1):379–401CrossRefGoogle Scholar

Copyright information

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

Authors and Affiliations

  1. 1.Departamento de Matemática Aplicada II, Escuela Técnica Superior de IngenieríaUniversidad de SevillaSevilleSpain

Personalised recommendations