AN ENUMERATION ALGORITHM FOR KNAPSACK PROBLEMS

被引：41

作者：

CABOT, AV

机构：

来源：

关键词：

D O I：

10.1287/opre.18.2.306

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：306 / &

共 14 条

[1] INTEGER PROGRAMMING - METHODS, USES, COMPUTATION [J].

BALINSKI, ML .

[2]

Bellman R.E, 1957, DYNAMIC PROGRAMMING

[3]

BRADLEY G, 686 STANF U OP RES H

[4]

COOK RA, 1965, AM652 DEP APPL MATH

[5]

Dantzig G.B., 1963, LINEAR PROGRAMMING

[6]

FOURIER JBJ, 1926, SOLUTION UNE QUESTI

[7] THEORY AND COMPUTATION OF KNAPSACK FUNCTIONS [J].

GILMORE, PC ;

GOMORY, RE .

[8] A LINEAR-PROGRAMMING APPROACH TO THE CUTTING-STOCK PROBLEM [J].

GILMORE, PC ;

GOMORY, RE .

[9] MULTISTAGE CUTTING STOCK PROBLEMS OF 2 AND MORE DIMENSIONS [J].

GILMORE, PC ;

GOMORY, RE .

[10] A LINEAR-PROGRAMMING APPROACH TO THE CUTTING STOCK PROBLEM .2. [J].

GILMORE, PC ;

GOMORY, RE .