A novel chaotic search for quadratic assignment problems

Author： Hasegawa M.   Ikeguchi T.   Aihara K.   Itoh K.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.139, Iss.3, 2002-06, pp. : 543-556

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

Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation

By Chiang W.-C.   Chi C.  

European Journal of Operational Research, Vol. 106, Iss. 2, 1998-04 ,pp. : 457-488

Elsevier

Access to resources Recommend Favorite

A polynomially solvable class of Quadratic Semi-Assignment Problems

By Malucelli F.  

European Journal of Operational Research, Vol. 91, Iss. 3, 1996-06 ,pp. : 619-622

Elsevier

Access to resources Recommend Favorite

The -assignment problems

By Chang G.J.   Ho P.-H.  

European Journal of Operational Research, Vol. 104, Iss. 3, 1998-02 ,pp. : 593-600

Elsevier

Access to resources Recommend Favorite

Network-based formulations of the quadratic assignment problem

By Ball M.O.   Kaku B.K.   Vakhutinsky A.  

European Journal of Operational Research, Vol. 104, Iss. 1, 1998-01 ,pp. : 241-249

Elsevier

Access to resources Recommend Favorite

Ranking in quadratic integer programming problems

By Gupta R.   Bandopadhyaya L.   Puri M.C.  

European Journal of Operational Research, Vol. 95, Iss. 1, 1996-11 ,pp. : 231-236

Elsevier

Access to resources Recommend Favorite