GENERALIZED LATTICE-POINT PROBLEM

被引：25
作者：
GLOVER, F
KLINGMAN, D
机构：
[1] UNIV COLORADO, BOULDER, CO 80302 USA
[2] UNIV TEXAS, AUSTIN, TX 78712 USA
来源：
OPERATIONS RESEARCH | 1973年 / 21卷 / 01期
关键词：
D O I：
10.1287/opre.21.1.141
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：141 / 155
页数：15
相关论文
共 18 条
[1]   INTERSECTION CUT FROM DUAL OF UNIT HYPERCUBE [J].
BALAS, E ;
BOWMAN, VJ ;
GLOVER, F ;
SOMMER, D .
OPERATIONS RESEARCH, 1971, 19 (01) :40-+
[2]   INTERSECTION CUTS - NEW TYPE OF CUTTING PLANES FOR INTEGER PROGRAMMING [J].
BALAS, E .
OPERATIONS RESEARCH, 1971, 19 (01) :19-+
[3]  
BALAS E, 1970, 17 TIMS INT C LOND
[4]  
BALAS E, 1970, 214 CARN MELL U MAN
[5]  
BURDET CA, 1970, NOV CARN MELL U WORK
[6]  
Charnes A., 1961, MANAGEMENT MODELS IN
[7]  
CHARNES A, UNPUBLISHED NOTES
[8]  
Charnes A., 1961, MANAGEMENT MODELS IN, V1
[9]   CONVEXITY CUTS AND CUT SEARCH [J].
GLOVER, F .
OPERATIONS RESEARCH, 1973, 21 (01) :123-134
[10]   CONCAVE PROGRAMMING APPLIED TO A SPECIAL CLASS OF 0-1 INTEGER PROGRAMS [J].
GLOVER, F ;
KLINGMAN, D .
OPERATIONS RESEARCH, 1973, 21 (01) :135-140
12