Effective algorithm for solving a two-level facility location problem on a tree-like network
E. Kh. Gimadiab, A. A. Kurochkina
a Sobolev Institute of Mathematics, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
A two-level facility location problem on a tree-like network is considered. The transportation cost between each pair of sites is defined as the length of the corresponding path in the network. An exact algorithm for solving the problem with time-complexity equals to $O(nm^3)$ is constructed, where $n$ is the number of consumers and $m$ is the maximum number of facilities at both levels. Il. 3, bibliogr. 7.
$2$-level facility location problem, polynomial algorithm, tree-like network.
PDF file (302 kB)
Journal of Applied and Industrial Mathematics, 2013, 7:2, 177–186
E. Kh. Gimadi, A. A. Kurochkin, “Effective algorithm for solving a two-level facility location problem on a tree-like network”, Diskretn. Anal. Issled. Oper., 19:6 (2012), 9–22; J. Appl. Industr. Math., 7:2 (2013), 177–186
Citation in format AMSBIB
\by E.~Kh.~Gimadi, A.~A.~Kurochkin
\paper Effective algorithm for solving a~two-level facility location problem on a~tree-like network
\jour Diskretn. Anal. Issled. Oper.
\jour J. Appl. Industr. Math.
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|