An extreme point algorithm for a local minimum solution to the quadratic assignment problem

Chawki A. Fedjki, Salih O. Duffuaa*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

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.

Original languageEnglish
Pages (from-to)566-578
Number of pages13
JournalEuropean Journal of Operational Research
Volume156
Issue number3
DOIs
StatePublished - 1 Aug 2004

Keywords

  • Extreme point
  • Local star minimum
  • Network
  • Quadratic assignment problem

ASJC Scopus subject areas

  • General Computer Science
  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Fingerprint

Dive into the research topics of 'An extreme point algorithm for a local minimum solution to the quadratic assignment problem'. Together they form a unique fingerprint.

Cite this