Experimental analysis of algorithms for the independent quadratic assignment problem
| Year of publication: |
2024
|
|---|---|
| Authors: | Yang, Wei ; Wang, Yang ; Ćustić, Ante ; Punnen, Abraham P. |
| Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 168.2024, Art.-No. 106704, p. 1-10
|
| Subject: | Independent quadratic assignment | Path-relinking | Quadratic assignment | Very large-scale neighborhood search | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Algorithmus | Algorithm |
-
An iterative algorithm for the max-min knapsack problem with multiple scenarios
Al-douri, Thekra, (2021)
-
A GRASP/Path-Relinking algorithm for the traveling purchaser problem
Cuellar-Usaquén, Daniel, (2023)
-
Exact algorithms for the solution of the grey pattern quadratic assignment problem
Drezner, Zvi, (2015)
- More ...
-
The rank-one quadratic assignment problem
Wang, Yang, (2021)
-
A three-phase matheuristic algorithm for the multi-day task assignment problem
Wang, Yang, (2023)
-
The boolean quadratic programming problem with generalized upper bound constraints
Wang, Yang, (2017)
- More ...