SOME COMPUTATIONAL RESULTS ON REAL 0-1 KNAPSACK-PROBLEMS

被引:4
作者
MURPHY, RA
机构
关键词
D O I
10.1016/0167-6377(86)90105-7
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:67 / 71
页数:5
相关论文
共 8 条
[1]   AN ALGORITHM FOR LARGE ZERO-ONE KNAPSACK-PROBLEMS [J].
BALAS, E ;
ZEMEL, E .
OPERATIONS RESEARCH, 1980, 28 (05) :1130-1154
[2]   THE LAGRANGIAN-RELAXATION METHOD FOR SOLVING INTEGER PROGRAMMING-PROBLEMS [J].
FISHER, ML .
MANAGEMENT SCIENCE, 1981, 27 (01) :1-18
[3]  
Geoffrion A., 1974, MATH PROGRAMMING STU, V2, DOI [10.1007/BFb0120690, DOI 10.1007/BFB0120686]
[4]  
INGARGIOLA G, 1973, MANAGE SCI, V2, P460
[5]   EFFICIENT ALGORITHM FOR 0-1 KNAPSACK PROBLEM [J].
NAUSS, RM .
MANAGEMENT SCIENCE, 1976, 23 (01) :27-31
[6]   BRANCH AND BOUND ALGORITHM FOR GENERALIZED ASSIGNMENT PROBLEM [J].
ROSS, GT ;
SOLAND, RM .
MATHEMATICAL PROGRAMMING, 1975, 8 (01) :91-103
[7]   MODELING FACILITY LOCATION PROBLEMS AS GENERALIZED ASSIGNMENT PROBLEMS [J].
ROSS, GT ;
SOLAND, RM .
MANAGEMENT SCIENCE, 1977, 24 (03) :345-357
[8]   DIRECT DESCENT BINARY KNAPSACK ALGORITHM [J].
ZOLTNERS, AA .
JOURNAL OF THE ACM, 1978, 25 (02) :304-311