On A Special Case of the Quadratic Assignment Problem with an Application to Storage-and-Retrieval Devices

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.138, Iss.1, 2005-09, pp. : 223-233

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

Genetic algorithm hybridized with ruin and recreate procedure: application to the quadratic assignment problem

By Misevicius A.

Knowledge-Based Systems, Vol. 16, Iss. 5, 2003-07 ,pp. : 261-268

Elsevier

Access to resources Recommend Favorite

On the landscape ruggedness of the quadratic assignment problem

By Angel E. Zissimopoulos V.

Theoretical Computer Science, Vol. 263, Iss. 1, 2001-07 ,pp. : 159-172

Elsevier

Access to resources Recommend Favorite

Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods

By Drezner Zvi

Annals of Operations Research, Vol. 139, Iss. 1, 2005-10 ,pp. : 65-94

Springer Publishing Company

Access to resources Recommend Favorite

Improved Lower Bounds for the Quadratic Assignment Problem

By Sergeev S. I.

Automation and Remote Control, Vol. 65, Iss. 11, 2004-11 ,pp. : 1733-1746

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Parallel Ant Colonies for the quadratic assignment problem

By Talbi E.-G. Roux O. Fonlupt C. Robillard D.

Future Generation Computer Systems, Vol. 17, Iss. 4, 2001-01 ,pp. : 441-449

Elsevier

Access to resources Recommend Favorite