EFFICIENT HEURISTIC ALGORITHMS FOR POSITIVE 0-1 POLYNOMIAL PROGRAMMING-PROBLEMS

被引：3

作者：

GRANOT, F

机构：

来源：

MANAGEMENT SCIENCE | 1982年 / 28卷 / 07期

关键词：

D O I：

10.1287/mnsc.28.7.829

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：829 / 836

页数：8

共 23 条

[1] PIVOT AND COMPLEMENT - A HEURISTIC FOR 0-1 PROGRAMMING [J].

BALAS, E ;

MARTIN, CH .

MANAGEMENT SCIENCE, 1980, 26 (01) :86-96

[2]

FAALAND DH, 1979, OPERATIONS RES, V27, P1069

[3] GENERALIZED LATTICE-POINT PROBLEM [J].

GLOVER, F ;

KLINGMAN, D .

OPERATIONS RESEARCH, 1973, 21 (01) :141-155

[4] CONVERTING 0-1 POLYNOMIAL PROGRAMMING PROBLEM TO A 0-1 LINEAR PROGRAM [J].

GLOVER, F ;

WOOLSEY, E .

OPERATIONS RESEARCH, 1974, 22 (01) :180-182

[5] COVERING RELAXATION FOR POSITIVE 0-1 POLYNOMIAL PROGRAMS [J].

GRANOT, D ;

GRANOT, F ;

KALLBERG, J .

MANAGEMENT SCIENCE, 1979, 25 (03) :264-273

[6] GENERALIZED COVERING RELAXATION FOR 0-1 PROGRAMS [J].

GRANOT, D ;

GRANOT, F .

OPERATIONS RESEARCH, 1980, 28 (06) :1442-1450

[7]

GRANOT D, 1982, MATH PROGRAMMING, V22

[8]

HAMMER PL, 1969, OPERATIONS RES STATI, V48

[9] EFFICIENT HEURISTIC PROCEDURES FOR INTEGER LINEAR PROGRAMMING WITH AN INTERIOR [J].

HILLIER, FS .

OPERATIONS RESEARCH, 1969, 17 (04) :600-&

[10]

KOCKENBERG GA, 1974, DECISION SCI, V5, P36

← 1 2 3 →