On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines

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

Аннотация

We study the network facility location problem with constraints on the capacities of communication lines, called Restricted Facility Location Problem (RFLP). It is required to locate facilities at the vertices of a given network graph so as to simultaneously satisfy the demands of the clients, which are also located at the vertices of the network graph, at minimum cost. We consider two statements of the problem: the multiple-allocation RFLP, where the demand of a client can be satisfied jointly by several facilities, and the single-allocation RFLP, where the demand of a client must be entirely satisfied by a single facility. We show that the single-allocation RFLP is NP-hard even if the network is a simple path and strongly NP-hard if the network is a tree. The multipleallocation RFLP is weakly NP-hard on trees. For this problem we propose a pseudopolynomial algorithm for the case where the network graph has constant treewidth, and show a linear-time algorithm for the case where the network is a simple path.

Язык оригиналаанглийский
Страницы (с-по)108-124
Число страниц17
ЖурналTrudy Instituta Matematiki i Mekhaniki UrO RAN
Том26
Номер выпуска2
DOI
СостояниеОпубликовано - 1 фев 2020

ГРНТИ

  • 27 МАТЕМАТИКА

Fingerprint Подробные сведения о темах исследования «On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines». Вместе они формируют уникальный семантический отпечаток (fingerprint).

  • Цитировать