An Extreme Point Algorithm For A Local Minimum Solution To The Quadratic Assignment Problem
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.
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/2565/1/an_extreme_point_algorithm_for_a_local_m_fedjki_isi_000220763700004.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|