Branch and bound algorithms for the multidimensional assignment problem

Author： Pasiliao Eduardo   Pardalos Panos   Pitsoulis Leonidas  

Publisher： Taylor & Francis Ltd

ISSN： 1055-6788

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

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

Test Problem Generator for the Multidimensional Assignment Problem

By Grundel Don   Pardalos Panos  

Computational Optimization and Applications, Vol. 30, Iss. 2, 2005-02 ,pp. : 133-146

Springer Publishing Company

Access to resources Recommend Favorite

On the number of local minima for the multidimensional assignment problem

By Grundel Don   Krokhmal Pavlo   Oliveira Carlos   Pardalos Panos  

Journal of Combinatorial Optimization, Vol. 13, Iss. 1, 2007-01 ,pp. : 1-18

Springer Publishing Company

Access to resources Recommend Favorite

Solving the Multidimensional Assignment Problem by a Cross-Entropy method

By Nguyen Duc   Le Thi Hoai   Pham Dinh Tao  

Journal of Combinatorial Optimization, Vol. 27, Iss. 4, 2014-05 ,pp. : 808-823

Springer Publishing Company

Access to resources Recommend Favorite

A Branch and Bound Algorithm for Primary Routes Assignment in Survivable Connection Oriented Networks

By Walkowiak Krzysztof M.  

Computational Optimization and Applications, Vol. 27, Iss. 2, 2004-02 ,pp. : 149-171

Springer Publishing Company

Access to resources Recommend Favorite

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