ALGORITHMUS 47 - AN ALGORITHM FOR THE SOLUTION OF THE 0-1 KNAPSACK-PROBLEM

被引：89
作者：
FAYARD, D [1 ]
PLATEAU, G [1 ]
机构：
[1] UNIV LILLE 1,IEEA INFORMAT,F-59655 VILLENEUVE DASCQ,FRANCE
来源：
COMPUTING | 1982年 / 28卷 / 03期
关键词：
D O I：
10.1007/BF02241754
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
COMPUTER PROGRAMMING
引用
收藏
页码：269 / 287
页数：19
相关论文
共 12 条
[1]   AN ALGORITHM FOR LARGE ZERO-ONE KNAPSACK-PROBLEMS [J].
BALAS, E ;
ZEMEL, E .
OPERATIONS RESEARCH, 1980, 28 (05) :1130-1154
[2]   RESOLUTION OF 0-1 KNAPSACK PROBLEM - COMPARISON OF METHODS [J].
FAYARD, D ;
PLATEAU, G .
MATHEMATICAL PROGRAMMING, 1975, 8 (03) :272-307
[3]   EFFICIENT ALGORITHM FOR 0-1 KNAPSACK PROBLEM [J].
FAYARD, D ;
PLATEAU, G .
MANAGEMENT SCIENCE, 1978, 24 (09) :918-919
[4]  
FAYARD D, 1979, THESIS U SCI TECHNIQ
[5]  
FAYARD D, 1977, P C METHODS MATH PRO
[6]  
FAYARD D, 1977, PUBLICATION LABORATO, V91
[7]   BRANCH SEARCH ALGORITHM FOR KNAPSACK PROBLEM [J].
GREENBERG, H ;
HEGERICH, RL .
MANAGEMENT SCIENCE SERIES A-THEORY, 1970, 16 (05) :327-332
[8]  
Lawler E. L., 1979, Mathematics of Operations Research, V4, P339, DOI 10.1287/moor.4.4.339
[9]   ALGORITHM FOR SOLUTION OF 0-1 SINGLE KNAPSACK PROBLEM [J].
MARTELLO, S ;
TOTH, P .
COMPUTING, 1978, 21 (01) :81-86
[10]   IMPLEMENTING QUICKSORT PROGRAMS [J].
SEDGEWICK, R .
COMMUNICATIONS OF THE ACM, 1978, 21 (10) :847-857
12