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

Author： Kravtsov V.  

Publisher： Springer Publishing Company

ISSN： 1060-0396

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

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 quadratic assignment problem on networks

By Zabudskii G.  

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

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

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

Branch and bound algorithms for the multidimensional assignment problem

By Pasiliao Eduardo   Pardalos Panos   Pitsoulis Leonidas  

Optimization Methods and Software, Vol. 20, Iss. 1, 2005-02 ,pp. : 127-143

Taylor & Francis Ltd

Access to resources Recommend Favorite

Combinatorial properties of noninteger vertices of a polytope in a three-index axial assignment problem

By Kravtsov V.  

Cybernetics and Systems Analysis, Vol. 43, Iss. 1, 2007-01 ,pp. : 25-33

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