ALGORITHM FOR 0-1 KNAPSACK PROBLEM

被引：12

作者：

LAURIERE, M

机构：

来源：

关键词：

D O I：

10.1007/BF01588947

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：1 / 10

页数：10

共 20 条

[1]

BALAS E, 1975, OPERATIONS RESEARCH, V15, P915

[2]

Bradley G. H., 1971, Discrete Mathematics, V1, P29, DOI 10.1016/0012-365X(71)90005-7

[3]

DEMBRO RS, 1975, REDUCTION ALGORITHM

[4]

Faaland B, 1972, J COMBINATORIAL THEO, V13, P170

[5] RESOLUTION OF 0-1 KNAPSACK PROBLEM - COMPARISON OF METHODS [J].

FAYARD, D ;

PLATEAU, G .

[6]

Garfinkel R. S., 1972, INTEGER PROGRAMMING

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

GILMORE, PC ;

GOMORY, RE .

[8]

GONDRAN M, 1973, REV AUTOMATIQUE INFO, V3, P35

[9] BRANCH SEARCH ALGORITHM FOR KNAPSACK PROBLEM [J].

GREENBERG, H ;

HEGERICH, RL .

MANAGEMENT SCIENCE SERIES A-THEORY, 1970, 16 (05) :327-332

[10]

HANSEN P, 1974, THESIS BRUXELLES