|
Diskretnyi Analiz i Issledovanie Operatsii, 2011, Volume 18, Issue 4, Pages 49–65
(Mi da659)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Polynomial algorithms for solving the quadratic bottleneck assignment problem on networks
G. G. Zabudsky, A. Yu. Lagzdin Omsk Department of S. L. Sobolev Institute of Mathematics, SB RAS, Omsk, Russsia
Abstract:
The quadratic bottleneck assignment problem in terms of graphs is considered. The goal is to find permutation of the graph vertices on the network nodes that minimizes the cost between adjacent vertices. We provide polynomial algorithms for solving the problem on special networks. Ill. 7, bibliogr. 13.
Keywords:
quadratic bottleneck assignment problem, location problem, polynomial algorithm, graph.
Received: 31.05.2010 Revised: 20.06.2011
Citation:
G. G. Zabudsky, A. Yu. Lagzdin, “Polynomial algorithms for solving the quadratic bottleneck assignment problem on networks”, Diskretn. Anal. Issled. Oper., 18:4 (2011), 49–65
Linking options:
https://www.mathnet.ru/eng/da659 https://www.mathnet.ru/eng/da/v18/i4/p49
|
Statistics & downloads: |
Abstract page: | 623 | Full-text PDF : | 147 | References: | 63 | First page: | 9 |
|