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

0.00 Avg rating0 Votes
Article ID: iaor20052318
Country: Netherlands
Volume: 156
Issue: 3
Start Page Number: 566
End Page Number: 578
Publication Date: Aug 2004
Journal: European Journal of Operational Research
Authors: ,
Keywords: networks
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 local star minimum are obtained. Then an extreme point algorithm for QAP is proposed.

Reviews

Required fields are marked *. Your email address will not be published.