Polynomial algorithms for solving the quadratic assignment problem on networks

被引：0
作者：
G. G. Zabudskii
A. Yu. Lagzdin
机构：
[1] Russian Academy of Sciences,Omsk Branch of Sobolev Institute of Mathematics, Siberian Branch
来源：
Computational Mathematics and Mathematical Physics | 2010年 / 50卷
关键词：
quadratic assignment problem; facility location problem; polynomial algorithms; graphs; networks;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Polynomial algorithms for solving the quadratic assignment problem on special types of networks are proposed. The structure of the links between the objects to be located is represented by a graph.
引用
收藏
页码：1948 / 1955
页数：7
相关论文
共 14 条
[1]  
Demidenko V. M.(2003)A Generalization of the Strong Solvability Condition for the Quadratic Assignment Problem with anti-Monge and Toeplitz Matrices Dokl. National Acad. Sci. Belarusi 47 15-18
[2]  
Metel’skii N. N.(1984)Local Optimization Methods in the Bipartite Graph Location Problem Zh. Vychisl. Mat. Mat. Fiz. 24 1428-1432
[3]  
Burkard R. E.(1998)The Quadratic Assignment Problem with a Monotone anti-Monge Matrix and a Symmetric Toeplitz Matrix: Easy and Hard Cases Math. Program., Ser. B 82 125-158
[4]  
Çela E.(2006)Well Solvable Cases of the Quadratic Assignment Problem with Monotone and Bimonotone Matrices J. Math. Modelling Algorithms 5 167-187
[5]  
Rote G.(1957)Assignment Problems and the Location of Economic Activities Econometrica 25 53-76
[6]  
Woeginger G. J.(1926)The Maximum of a Certain Bilinear Form Proc. London Math. Soc. 25 265-282
[7]  
Demidenko V. M.(undefined)undefined undefined undefined undefined-undefined
[8]  
Finke G.(undefined)undefined undefined undefined undefined-undefined
[9]  
Gordon V. S.(undefined)undefined undefined undefined undefined-undefined
[10]  
Koopmans T. C.(undefined)undefined undefined undefined undefined-undefined
12