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

Author： Torki A.   Yajima Y.   Enkawa T.  

Publisher： Elsevier

ISSN： 0377-2217

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

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 suboptimal solution to a hierarchial network design problem using dynamic programming

By Sancho N.G.F.  

European Journal of Operational Research, Vol. 83, Iss. 1, 1995-05 ,pp. : 237-244

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

An integer programming approach to the time slot assignment problem in SS/TDMA systems with intersatellite links

By Lee T.   Park S.  

European Journal of Operational Research, Vol. 135, Iss. 1, 2001-11 ,pp. : 57-66

Elsevier

Access to resources Recommend Favorite

Linear programming for the 0-1 quadratic knapsack problem

By Billionnet A.   Calmels F.  

European Journal of Operational Research, Vol. 92, Iss. 2, 1996-07 ,pp. : 310-325

Elsevier

Access to resources Recommend Favorite

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