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 language | English |
|---|---|
| Pages (from-to) | 566-578 |
| Number of pages | 13 |
| Journal | European Journal of Operational Research |
| Volume | 156 |
| Issue number | 3 |
| DOIs | |
| State | Published - 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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver