Konu "Tabu search" için Fakülteler / Faculties listeleme
Toplam kayıt 1, listelenen: 1-1
-
On the Performance of Parallel Hybrid Algorithms for the Solution of the Quadratic Assignment Problem
(2015)The quadratic assignment problem (QAP) is a combinatorial optimization problem, which is computationally demanding, and considered to be NP-hard. Therefore, the problem cannot be solved in polynomial time. The known ...