|
This article is cited in 2 scientific papers (total in 2 papers)
Approximate solution of the $p$-median minimization problem
V. P. Il'evab, S. D. Il'evab, A. A. Navrotskayaab a Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia
b Omsk State University, Omsk, Russia
Abstract:
A version of the facility location problem (the well-known $p$-median minimization problem) and its generalization — the problem of minimizing a supermodular set function — is studied. These problems are NP-hard, and they are approximately solved by a gradient algorithm that is a discrete analog of the steepest descent algorithm. A priori bounds on the worst-case behavior of the gradient algorithm for the problems under consideration are obtained. As a consequence, a bound on the performance guarantee of the gradient algorithm for the $p$-median minimization problem in terms of the production and transportation cost matrix is obtained.
Key words:
combinatorial optimization, $p$-median, supermodular set function, gradient algorithm, performance guarantee.
Received: 16.11.2015 Revised: 16.02.2016
Citation:
V. P. Il'ev, S. D. Il'eva, A. A. Navrotskaya, “Approximate solution of the $p$-median minimization problem”, Zh. Vychisl. Mat. Mat. Fiz., 56:9 (2016), 1614–1621; Comput. Math. Math. Phys., 56:9 (2016), 1591–1597
Linking options:
https://www.mathnet.ru/eng/zvmmf10457 https://www.mathnet.ru/eng/zvmmf/v56/i9/p1614
|
Statistics & downloads: |
Abstract page: | 219 | Full-text PDF : | 134 | References: | 49 | First page: | 9 |
|