On multi-level network facility location problem

Edward Kh Gimadi; Yuri V. Shamardin

On multi-level network facility location problem

Результат исследования: Научные публикации в периодических изданиях › статья по материалам конференции › рецензирование

Аннотация

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

Доступ к документу

Link to publication in Scopus

Fingerprint Подробные сведения о темах исследования «On multi-level network facility location problem». Вместе они формируют уникальный семантический отпечаток (fingerprint).

Цитировать

@article{172a23832de344808e6520bf88463da1,

title = "On multi-level network facility location problem",

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.",

keywords = "Chain, Exact algorithm, Multi-level FLP, Network, Polynomial time, Tree",

author = "Gimadi, {Edward Kh} and Shamardin, {Yuri V.}",

year = "2018",

month = jan,

day = "1",

language = "English",

volume = "2098",

pages = "150--158",

journal = "CEUR Workshop Proceedings",

issn = "1613-0073",

note = "2018 School-Seminar on Optimization Problems and their Applications, OPTA-SCL 2018 ; Conference date: 08-07-2018 Through 14-07-2018",

}

On multi-level network facility location problem. / Gimadi, Edward Kh; Shamardin, Yuri V.

В: CEUR Workshop Proceedings, Том 2098, 01.01.2018, стр. 150-158.

Результат исследования: Научные публикации в периодических изданиях › статья по материалам конференции › рецензирование

TY - JOUR

T1 - On multi-level network facility location problem

AU - Gimadi, Edward Kh

AU - Shamardin, Yuri V.

PY - 2018/1/1

Y1 - 2018/1/1

N2 - 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.

AB - 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.

KW - Chain

KW - Exact algorithm

KW - Multi-level FLP

KW - Network

KW - Polynomial time

KW - Tree

UR - http://www.scopus.com/inward/record.url?scp=85048020741&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:85048020741

VL - 2098

SP - 150

EP - 158

JO - CEUR Workshop Proceedings

JF - CEUR Workshop Proceedings

SN - 1613-0073

T2 - 2018 School-Seminar on Optimization Problems and their Applications, OPTA-SCL 2018

Y2 - 8 July 2018 through 14 July 2018

ER -