Browsing Theses (Master's and Ph.D) – Industrial Engineering by Subject "QAPLIB, Branch and Bound, Simulated Annealing, Greedy Randomized Adaptive Search Procedure (GRASP)"

Now showing items 1-1 of 1

Analysis and performance measurement of existing solution methods of quadratic assignment problem

Karami, Morteza (Eastern Mediterranean University (EMU) - Doğu Akdeniz Üniversitesi (DAÜ), 2013-06)

ABSTRACT: Quadratic Assignment Problem (QAP) is known as one of the most difficult combinatorial optimization problems that is classified in the category of NP-hard problems. Quadratic Assignment Problem Library (QAPLIB) ...