Polynomial algorithms for solving the quadratic assignment problem on networks

ISSN： 0965-5425

Source： Computational Mathematics and Mathematical Physics, Vol.50, Iss.11, 2010-11, pp. : 1948-1955

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Polynomial algorithms for solving the vector sum problem

By Baburin A. Pyatkin A.

Journal of Applied and Industrial Mathematics, Vol. 1, Iss. 3, 2007-09 ,pp. : 268-272

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem

By Kravtsov V.

Cybernetics and Systems Analysis, Vol. 41, Iss. 6, 2005-11 ,pp. : 940-944

Springer Publishing Company

Access to resources Recommend Favorite

Hybrid Population-Based Algorithms for the Bi-Objective Quadratic Assignment Problem

By López-Ibáñez Manuel Paquete Luís Stützle Thomas

Journal of Mathematical Modelling and Algorithms, Vol. 5, Iss. 1, 2006-04 ,pp. : 111-137

Springer Publishing Company

Access to resources Recommend Favorite

A Hybrid Metaheuristic for the Quadratic Assignment Problem

By Tseng Lin-Yu Liang Shyi-Ching

Computational Optimization and Applications, Vol. 34, Iss. 1, 2006-05 ,pp. : 85-113

Springer Publishing Company

Access to resources Recommend Favorite

A Tabu Search Algorithm for the Quadratic Assignment Problem

By Misevicius Alfonsas

Computational Optimization and Applications, Vol. 30, Iss. 1, 2005-01 ,pp. : 95-111

Springer Publishing Company

Access to resources Recommend Favorite