Transforming Combinatorial Optimization Problems in Fourier Space: Consequences and Uses
We analyze three permutation-based combinatorial optimization problems in Fourier space, namely, the quadratic assignment problem, the linear ordering problem (LOP), and the symmetric and nonsymmetric traveling salesperson problem (STSP). In previous studies, one can find a number of theorems with n...
Saved in:
| Published in: | IEEE transactions on evolutionary computation Vol. 29; no. 4; pp. 977 - 989 |
|---|---|
| Main Authors: | , , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
IEEE
01.08.2025
|
| Subjects: | |
| ISSN: | 1089-778X, 1941-0026 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!