SHORTEST PATH ALGORITHMS FOR KNAPSACK TYPE PROBLEMS

被引：15

作者：

FRIEZE, AM ^{[1
]}

机构：

[1] UNIV LONDON,LONDON,ENGLAND

来源：

MATHEMATICAL PROGRAMMING | 1976年 / 11卷 / 02期

关键词：

D O I：

10.1007/BF01580382

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：150 / 157

页数：8

相关论文

共 9 条

[1] Dijkstra E., 1959, NUMER MATH, V1, P269
[2] THEORY AND COMPUTATION OF KNAPSACK FUNCTIONS
GILMORE, PC
GOMORY, RE
[J]. OPERATIONS RESEARCH, 1966, 14 (06) : 1045 - &
[3] MULTISTAGE CUTTING STOCK PROBLEMS OF 2 AND MORE DIMENSIONS
GILMORE, PC
GOMORY, RE
[J]. OPERATIONS RESEARCH, 1965, 13 (01) : 94 - &
[4] Gomory R. E., 1969, Linear Algebra and Its Applications, V2, P451, DOI 10.1016/0024-3795(69)90017-2
[5] GOMORY RE, 1965, P NATIONAL ACADEMY S, V53, P250
[6] Hu T.C., 1969, INTEGER PROGRAMMING
[7] MOORE E, 1959, 1957 P INT S THEOR 2
[8] DYNAMIC PROGRAMMING ALGORITHMS FOR INTEGER PROGRAMMING PROBLEM .I. INTEGER PROGRAMMING PROBLEM VIEWED AS A KNAPSACK TYPE PROBLEM
SHAPIRO, JF
[J]. OPERATIONS RESEARCH, 1968, 16 (01) : 103 - &
[9] GROUP THEORETIC ALGORITHMS FOR INTEGER PROGRAMMING PROBLEM .2. EXTENSION TO A GENERAL ALGORITHM
SHAPIRO, JF
[J]. OPERATIONS RESEARCH, 1968, 16 (05) : 928 - +