Improved Exact Algorithm for the Capacitated Facility Location Problem on a Line Graph

被引:0
|
作者
Gimadi, Edward [1 ,2 ]
Shtepa, Alexandr [2 ]
Tsidulko, Oxana [1 ,2 ]
机构
[1] Sobolev Inst Math, Novosibirsk, Russia
[2] Novosibirsk State Univ, Dept Mech & Math, Novosibirsk, Russia
基金
俄罗斯基础研究基金会;
关键词
Capaciteted Facility Location Problem; line graph; pseudopolynomial-time algorithm; NP-hard problem; totally monotone matrix;
D O I
10.1109/opcs.2019.8880248
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In the Capacitated Facility Location Problem (CFLP) the goal is to optimally place facilities at the vertices of a transportation network graph in order to minimize the total facility opening and transportation costs while considering additional restrictions on the facility capacities. The general problem is NP-hard. In this paper we study a special case of the CFLP, where the input transportation network graph is a line graph. We show how to improve the running-time of the best known pseudopolynomial-time algorithm for the CFLP on a line graph from [Mirchandani et al., 1996] by one order.
引用
收藏
页码:53 / 57
页数:5
相关论文
共 50 条