An Extreme Point Algorithm For A Local Minimum Solution To The Quadratic Assignment Problem

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

[img]
Preview
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

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
Divisions: College Of Computer Sciences and Engineering > Systems Engineering Dept
Depositing User: SYED AMEENUDDIN HUSSAIN
Date Deposited: 10 Jun 2008 11:38
Last Modified: 01 Nov 2019 16:30
URI: http://eprints.kfupm.edu.sa/id/eprint/1987