Network-based formulations of the quadratic assignment problem

Author： Ball M.O.   Kaku B.K.   Vakhutinsky A.  

Publisher： Elsevier

ISSN： 0377-2217

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

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

A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method

By Hahn P.   Grant T.   Hall N.  

European Journal of Operational Research, Vol. 108, Iss. 3, 1998-08 ,pp. : 629-640

Elsevier

Access to resources Recommend Favorite

New formulations and solution procedures for the hop constrained network design problem

By Pirkul H.   Soni S.  

European Journal of Operational Research, Vol. 148, Iss. 1, 2003-07 ,pp. : 126-140

Elsevier

Access to resources Recommend Favorite

A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem

By Torki A.   Yajima Y.   Enkawa T.  

European Journal of Operational Research, Vol. 94, Iss. 2, 1996-10 ,pp. : 384-391

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

Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem

By Katayama K.   Narihisa H.  

European Journal of Operational Research, Vol. 134, Iss. 1, 2001-10 ,pp. : 103-119

Elsevier

Access to resources Recommend Favorite