CONVERTING 0-1 POLYNOMIAL PROGRAMMING PROBLEM TO A 0-1 LINEAR PROGRAM

被引：281
作者：
GLOVER, F
WOOLSEY, E
机构：
[1] UNIV COLORADO,BOULDER,CO 80304
[2] COLORADO SCH MINES,GOLDEN,CO
来源：
OPERATIONS RESEARCH | 1974年 / 22卷 / 01期
关键词：
D O I：
10.1287/opre.22.1.180
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：180 / 182
页数：3
相关论文
共 10 条
[1]  
BALAS E, 1964, CR ACAD SC PARIS MAY
[2]   GENERALIZED LATTICE-POINT PROBLEM [J].
GLOVER, F ;
KLINGMAN, D .
OPERATIONS RESEARCH, 1973, 21 (01) :141-155
[3]  
HAMDY A, 1970, 702 U ARK RES REP
[4]  
HAMMER PL, 1969, A BBB METHOD LINEAR
[5]  
HANSEN P, 1971, 7 MATH PROGR S HAG
[6]  
LAWLER E, 1967, OPER RES, V15, P1098
[7]  
Mao J.C.T., 1968, MANAGE SCI, V15, P51
[8]  
MAO JC, 1969, MANAGE SCI, V15, P481
[9]   REDUCTION OF INTEGER POLYNOMIAL PROGRAMMING PROBLEMS TO ZERO-ONE LINEAR PROGRAMMING [J].
WATTERS, LJ .
OPERATIONS RESEARCH, 1967, 15 (06) :1171-&
[10]  
Zangwill WI, 1965, J ADVERTISING RES, V5, P23
1