COVERING RELAXATION FOR POSITIVE 0-1 POLYNOMIAL PROGRAMS

被引:12
作者
GRANOT, D [1 ]
GRANOT, F [1 ]
KALLBERG, J [1 ]
机构
[1] NYU,NEW YORK,NY 10003
关键词
D O I
10.1287/mnsc.25.3.264
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:264 / 273
页数:10
相关论文
共 15 条
[1]  
BALAS E, 1969, 196R CARN MELL U MAN
[2]  
Garfinkel R. S., 1972, INTEGER PROGRAMMING
[3]   INTEGER PROGRAMMING BY IMPLICIT ENUMERATION AND BALAS METHOD [J].
GEOFFRION, AM .
SIAM REVIEW, 1967, 9 (02) :178-+
[4]   GENERALIZED LATTICE-POINT PROBLEM [J].
GLOVER, F ;
KLINGMAN, D .
OPERATIONS RESEARCH, 1973, 21 (01) :141-155
[5]   CONVERTING 0-1 POLYNOMIAL PROGRAMMING PROBLEM TO A 0-1 LINEAR PROGRAM [J].
GLOVER, F ;
WOOLSEY, E .
OPERATIONS RESEARCH, 1974, 22 (01) :180-182
[6]  
GRANOT D, 1977, 533 FAC COMM BUS ADM
[7]  
Granot F., 1971, METHODS OPERATIONS R, V12, P154
[8]  
Hammer P. L., 1967, BOOLEAN METHODS OPER
[9]  
HAMMER PL, 1973, CORR7318 U WAT COMB
[10]  
HAMMER PL, 1969, OPERATIONS RES MAY