An Extreme Point Algorithm For A Local Minimum Solution To The Quadratic Assignment Problem. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 156. pp. 566-578.
|
PDF (A research paper on : An Extreme Point Algorithm For A Local Minimum Solution To The Quadratic Assignment Problem)
an_extreme_point_algorithm_for_a_local_m_fedjki_isi_000220763700004.pdf Download (28kB) | Preview |
Official URL: http://isi.kfupm.edu.sa/journals/pdf/A/an_extreme_...
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. (C) 2003 Elsevier B.V. All rights reserved.
| Item Type: | Article |
|---|---|
| Subjects: | Systems |
| Department: | College of Computing and Mathematics > lndustrial and Systems Engineering |
| Depositing User: | SYED AMEENUDDIN HUSSAIN |
| Date Deposited: | 10 Jun 2008 08:38 |
| Last Modified: | 01 Nov 2019 13:30 |
| URI: | http://eprints.kfupm.edu.sa/id/eprint/1987 |