Journal article
Recent advances in the solution of quadratic assignment problems
Mathematical programming, Vol.97(1-2), pp.27-42
07/01/2003
DOI: 10.1007/s10107-003-0437-z
Abstract
The quadratic assignment problem (QAP) is notoriously difficult for exact solution methods. In the past few years a number of long-open QAPs, including those posed by Steinberg (1961), Nugent et al. (1968) and Krarup (1972) were solved to optimality for the first time. The solution of these problems has utilized both new algorithms and novel computing structures. We describe these developments, as well as recent work which is likely to result in the solution of even more difficult instances.
Details
- Title: Subtitle
- Recent advances in the solution of quadratic assignment problems
- Creators
- Kurt M Anstreicher - Department of Management Sciences, University of Iowa, Iowa City, IA 52242, United States
- Resource Type
- Journal article
- Publication Details
- Mathematical programming, Vol.97(1-2), pp.27-42
- Publisher
- Springer
- DOI
- 10.1007/s10107-003-0437-z
- ISSN
- 0025-5610
- eISSN
- 1436-4646
- Language
- English
- Date published
- 07/01/2003
- Academic Unit
- Business Analytics; Industrial and Systems Engineering; Computer Science
- Record Identifier
- 9984380615402771
Metrics
1 Record Views