QAPLIB - A Quadratic Assignment Problem Library - Problem instances and solutions
收藏DataCite Commons2023-04-27 更新2025-04-17 收录
下载链接：
https://datashare.ed.ac.uk/handle/10283/4390
下载链接
链接失效反馈官方服务：
资源简介：
The Quadratic Assignment Problem (QAP) has remained one of the great challenges in combinatorial optimization. It is still considered a computationally nontrivial task to solve modest size problems, say of size n=25. The QAPLIB was first published in 1991, in order to provide a unified testbed for QAP, accessible to the scientific community. It consisted of virtually all QAP instances that were accessible to the authors at that time.
提供机构：
University of Edinburgh; Computational Optimization Research At Lehigh
创建时间：
2022-03-31
