Comments on: Extensive facility location problems on networks: an updated review
- 49 Downloads
In network location theory, the shapes of facilities can be points, paths, or trees. Path- and tree-shaped facilities are called extensive facilities. Location problems with extensive facilities are of both theoretical interests and practical importance and thus have received much attention in the past decades. This paper gives an excellent review on extensive facility locations problems on networks. More specifically, the authors introduce a wide variety of problems that have been studied in this research field and give the best known results for each of them. In addition, basic tools and common techniques for solving these kinds of problems are described. I benefited greatly from this article. Especially, I got a more complete and much clearer overview of this challenging field of research. This article is definitely useful for anyone seeking for a succinct summary of this research field, especially for Ph.D. students and new researchers in this field. A few comments are given in...
- Novik A (1996) Improved algorithms for locating tree or path shaped facilities on a tree network. M.S. Thesis, School of Mathematical Sciences, Tel Aviv University, Tel Aviv, IsraelGoogle Scholar
- Puerto J, Ricca F, Scozzari A (2011) Minimax regret path location on trees. Networks 58(2):147–158Google Scholar
- Ye J-H (2017) Improved algorithms for minmax regret path location problems on trees. Ph.D. Dissertation, Department of Computer Science, Nation Tsing Hua UniversityGoogle Scholar