A novel chaotic search for quadratic assignment problems

By Hasegawa M.   Ikeguchi T.   Aihara K.   Itoh K.  

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

Elsevier

Access to resources Recommend Favorite

Inapproximability and a polynomially solvable special case of a network improvement problem

By Zhang J.Z.   Yang X.G.   Cai M.C.  

European Journal of Operational Research, Vol. 155, Iss. 1, 2004-05 ,pp. : 251-257

Elsevier

Access to resources Recommend Favorite

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

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