Showing 1 - 9 of 9
Persistent link: https://www.econbiz.de/10008760307
Persistent link: https://www.econbiz.de/10001969559
Persistent link: https://www.econbiz.de/10005347566
Persistent link: https://www.econbiz.de/10008164555
Persistent link: https://www.econbiz.de/10008733811
Persistent link: https://www.econbiz.de/10008214080
In this study, we introduce a cooperative parallel tabu search algorithm (CPTS) for the quadratic assignment problem (QAP). The QAP is an NP-hard combinatorial optimization problem that is widely acknowledged to be computationally demanding. These characteristics make the QAP an ideal candidate...
Persistent link: https://www.econbiz.de/10005287294
Persistent link: https://www.econbiz.de/10005283554
Persistent link: https://www.econbiz.de/10006818736