BRANCHING FROM LARGEST UPPER BOUND FOLKLORE AND FACTS

被引：12

作者：

FOX, BL

LENSTRA, JK

RINNOOYKAN, AHG

SCHRAGE, LE

机构：

[1] MATH CENTRUM,AMSTERDAM,NETHERLANDS

[2] ERASMUS UNIV,ROTTERDAM,NETHERLANDS

[3] UNIV CHICAGO,CHICAGO,IL 60637

来源：

关键词：

D O I：

10.1016/0377-2217(78)90092-9

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：191 / 194

页数：4

共 9 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2]

B├a┬nichou M., 1971, MATH PROGRAM, V1, P76, DOI DOI 10.1007/BF01584074

[3]

DENARDO EV, UNPUBLISHED

[4] ACCELERATING LIST PROCESSING IN DISCRETE PROGRAMMING [J].

FOX, BL .

[5]

Garfinkel R. S., 1972, INTEGER PROGRAMMING

GEOFFRIO.AM .

[7]

*INT BUS MACH CORP, 1971, MPSXMIP PROGR DESCR

[8] BRANCH-AND-BOUND METHODS - A SURVEY [J].

LAWLER, EL ;

WOOD, DE .

[9]

1975, SPERRY UNIVAC 1100 S