ON THE USE OF EXACT AND HEURISTIC CUTTING PLANE METHODS FOR THE QUADRATIC ASSIGNMENT PROBLEM

被引:34
作者
BAZARAA, MS [1 ]
SHERALI, HD [1 ]
机构
[1] VIRGINIA POLYTECH INST & STATE UNIV, BLACKSBURG, VA 24061 USA
关键词
D O I
10.1057/jors.1982.210
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:991 / 1003
页数:13
相关论文
共 23 条
[1]   INTERSECTION CUTS - NEW TYPE OF CUTTING PLANES FOR INTEGER PROGRAMMING [J].
BALAS, E .
OPERATIONS RESEARCH, 1971, 19 (01) :19-+
[2]  
BALAS E, 1973, 294 CARN MELL U MAN
[3]  
BALAS E, 1974, 348 CARN MELL U MAN
[4]  
BALAS E, 1974, 330 CARN MELL U MAN
[5]   BENDERS PARTITIONING SCHEME APPLIED TO A NEW FORMULATION OF THE QUADRATIC ASSIGNMENT PROBLEM [J].
BAZARAA, MS ;
SHERALI, HD .
NAVAL RESEARCH LOGISTICS, 1980, 27 (01) :29-41
[6]  
BAZARAA MS, 1982, NETWORKS
[7]  
Bazaraa MS., 2008, LINEAR PROGRAMMING N
[8]  
BURKARD RE, 1978, NAVAL RES LOGIST Q, V25, P229
[9]   SOLVING CERTAIN NONCONVEX QUADRATIC MINIMIZATION PROBLEMS BY RANKING EXTREME POINTS [J].
CABOT, AV ;
FRANCIS, RL .
OPERATIONS RESEARCH, 1970, 18 (01) :82-&
[10]   HOSPITAL LAYOUT AS A QUADRATIC ASSIGNMENT PROBLEM [J].
ELSHAFEI, AN .
OPERATIONAL RESEARCH QUARTERLY, 1977, 28 (01) :167-179