An Extreme Point Algorithm For A Local Minimum Solution To The Quadratic Assignment Problem. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH;, 156. pp. 566578.

PDF
an_extreme_point_algorithm_for_a_local_m_fedjki_isi_000220763700004.pdf Download (28kB)  Preview 
Abstract
In this paper the network structure of basic solutions to the quadratic assignment problem (QAP) is revisited. The concept of a relative local star minimum is introduced. Results characterizing a relative local star minimum are obtained. Then an extreme point algorithm for QAP is proposed.
Item Type:  Article 

Subjects:  Computer 
Department:  College of Computing and Mathematics > lndustrial and Systems Engineering 
Depositing User:  SHAIKH ARIFUSALAM 
Date Deposited:  14 Jun 2008 10:33 
Last Modified:  01 Nov 2019 13:44 
URI:  http://eprints.kfupm.edu.sa/id/eprint/2565 