1 paper · 1 filter
Puneet S. Bagga, Arthur Delarue
The Quadratic Assignment Problem (QAP) is an NP-hard problem which has proven particularly challenging to solve: unlike other combinatorial problems like the traveling salesman pro…