Abstract
The article is intended to fill the recent review of Ortiz-Astorquiza, C. at al. (2017) on multi-level facility location problem (MLFLP). The article presents the results of some publications, information about which is missing in this review. We are talking about the construction of polynomial exact algorithms for solving some subclasses of the network MLFLP. Namely, the design of polynomial time algorithms for the multi-level FLP on a chain graph and the two-level FLP on a tree graph are discussed. We also show that the a known result of Trubin V. A. and Sharifov F.A. (1992) for the general multi-level FLP on a tree is incorrect.
| Original language | English |
|---|---|
| Pages (from-to) | 150-158 |
| Number of pages | 9 |
| Journal | CEUR Workshop Proceedings |
| Volume | 2098 |
| Publication status | Published - 1 Jan 2018 |
| Event | 2018 School-Seminar on Optimization Problems and their Applications, OPTA-SCL 2018 - Omsk, Russian Federation Duration: 8 Jul 2018 → 14 Jul 2018 |
Keywords
- Chain
- Exact algorithm
- Multi-level FLP
- Network
- Polynomial time
- Tree