1 citations · 1 across the 5 of their papers we have counts for
1 paper · 1 filter
Pawan Aurora, Hans Raj Tiwary
The Quadratic Assignment Problem (QAP) is a well-known NP-hard problem that is equivalent to optimizing a linear objective function over the QAP polytope. The QAP polytope with par…