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}
}
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

Citations

Publications citing this paper.
Showing 1-10 of 32 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 20 references

Generation of quadratic assignment test problems with known optimal solutions (in Russian),” Zh

  • G. S. Palubetskis
  • Vychisl. Mat. Mat. Fiz., vol. 28, pp. 1740-1743,
  • 1988
Highly Influential
12 Excerpts

Pm

  • Y. Li
  • Pardalos, K.G. Ramakrishnan, and M.G.C. Resende…
  • 1992
1 Excerpt

and Y

  • PM. Pardalos, K. A. Murthy
  • Li, “Computational experience with parallel…
  • 1992
2 Excerpts

Locations with spatial interactions: The quadratic assignment problem, “Discrete location theory,

  • R. E. Burkard
  • Chapter 9,
  • 1990
3 Excerpts

and PM

  • K. A. Murth
  • Pardalos, “A polynomial-time approximation…
  • 1990

Similar Papers

Loading similar papers…