Аннотация
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.
Язык оригинала | английский |
---|---|
Страницы (с-по) | 150-158 |
Число страниц | 9 |
Журнал | CEUR Workshop Proceedings |
Том | 2098 |
Состояние | Опубликовано - 1 янв 2018 |
Событие | 2018 School-Seminar on Optimization Problems and their Applications, OPTA-SCL 2018 - Omsk, Российская Федерация Продолжительность: 8 июл 2018 → 14 июл 2018 |