- DSpace Home
- →
- Browsing by Subject
JavaScript is disabled for your browser. Some features of this site may not work without it.
Browsing by Subject "QAPLIB, Branch and Bound, Simulated Annealing, Greedy Randomized Adaptive Search Procedure (GRASP)"
Now showing items 1-1 of 1
-
(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) ...
Now showing items 1-1 of 1
EMU I-Rep by Eastern Mediterranean University Institutional Repository is licensed under a Creative Commons Attribution-Gayriticari-NoDerivs 3.0 Unported License
EMU I-Rep:
