Highly Influenced

# Generating quadratic assignment test problems with known optimal permutations

@article{Li1992GeneratingQA, title={Generating quadratic assignment test problems with known optimal permutations}, author={Yong Li and Panos M. Pardalos}, journal={Comp. Opt. and Appl.}, year={1992}, volume={1}, pages={163-184} }

- Published 1992 in Comp. Opt. and Appl.
DOI:10.1007/BF00253805

The quadratic assignment problem (QAP) is a well-known combinatorial optimization problem of which the travelling-salesman problem is a special case. Although the QAP has been extensively studied during the past three decades, this problem remains very hard to solve. Problems of sizes greater than 15 are generally impractical to solve. For this reason, many heuristics have been developed. However, in the literature, there is a lack of test problems with known optimal solutions for evaluating… CONTINUE READING