学术探索
学术期刊
新闻热点
数据分析
智能评审

QAPLIB - A quadratic assignment problem library

被引：362
作者：
Burkard, RE
Karisch, SE
Rendl, F
机构：
[1] GRAZ UNIV TECHNOL, DEPT MATH, A-8010 GRAZ, AUSTRIA
[2] UNIV COPENHAGEN, DEPT COMP SCI, DK-2100 COPENHAGEN, DENMARK
来源：
JOURNAL OF GLOBAL OPTIMIZATION | 1997年 / 10卷 / 04期
关键词：
quadratic assignment problem; data instances; problem library;
D O I：
10.1023/A:1008293323270
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
A collection of electronically available data instances for the Quadratic Assignment Problem is described. For each instance, we provide detailed information, indicating whether or not the problem is solved to optimality. If not, we supply the best known bounds for the problem. Moreover we survey available software and describe recent dissertations related to the Quadratic Assignment Problem.
引用
收藏
页码：391 / 403
页数：13
相关论文
共 41 条
[11]   AN EXACT ALGORITHM FOR THE QUADRATIC ASSIGNMENT PROBLEM ON A TREE [J].
CHRISTOFIDES, N ;
BENAVENT, E .
OPERATIONS RESEARCH, 1989, 37 (05) :760-768
[12]  
CLAUSEN J, 1994, IN PRESS COMPUTATION
[13]   HOSPITAL LAYOUT AS A QUADRATIC ASSIGNMENT PROBLEM [J].
ELSHAFEI, AN .
OPERATIONAL RESEARCH QUARTERLY, 1977, 28 (01) :167-179
[14]  
ESCHERMANN B, 1990, 20 INT S FAULT TOL C
[15]   OPTIMAL AND SUBOPTIMAL ALGORITHMS FOR THE QUADRATIC ASSIGNMENT PROBLEM [J].
GILMORE, PC .
JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1962, 10 (02) :305-313
[16]   A NEW LOWER BOUND VIA PROJECTION FOR THE QUADRATIC ASSIGNMENT PROBLEM [J].
HADLEY, SW ;
RENDL, F ;
WOLKOWICZ, H .
MATHEMATICS OF OPERATIONS RESEARCH, 1992, 17 (03) :727-739
[17]  
HAHN P, 1995, IN PRESS EUROPEAN J
[18]  
JOHNSON TA, 1992, THESIS CLEMSON U CLE
[19]   Lower bounds for the quadratic assignment problem via triangle decompositions [J].
Karisch, SE ;
Rendl, F .
MATHEMATICAL PROGRAMMING, 1995, 71 (02) :137-151
[20]  
KARISCH SE, 1995, SEMIDEFINITE PROGRAM
12345