METHODS FOR SOLUTION OF MULTIDIMENSIONAL 0/1 KNAPSACK PROBLEM

被引:137
作者
WEINGARTNER, HM
NESS, DN
机构
关键词
D O I
10.1287/opre.15.1.83
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:83 / +
页数:1
相关论文
共 11 条
[1]   COMMENT ON DANTZIG PAPER ON DISCRETE VARIABLE EXTREMUM PROBLEMS [J].
BELLMAN, R .
OPERATIONS RESEARCH, 1957, 5 (05) :723-724
[2]  
BELLMAN R, APPLIED DYNAMIC PROG
[4]   DISCRETE-VARIABLE EXTREMUM PROBLEMS [J].
DANTZIG, GB .
OPERATIONS RESEARCH, 1957, 5 (02) :266-277
[6]   A LINEAR-PROGRAMMING APPROACH TO THE CUTTING STOCK PROBLEM .2. [J].
GILMORE, PC ;
GOMORY, RE .
OPERATIONS RESEARCH, 1963, 11 (06) :863-888
[7]   A MULTIPHASE-DUAL ALGORITHM FOR ZERO-1 INTEGER PROGRAMMING PROBLEM [J].
GLOVER, F .
OPERATIONS RESEARCH, 1965, 13 (06) :879-&
[8]   THE LOADING PROBLEM [J].
PANDIT, SNN .
OPERATIONS RESEARCH, 1962, 10 (05) :639-646
[9]  
SAMUEL AL, 1959, IBM J RES DEV, V3, P211, DOI 10.1147/rd.441.0206
[10]  
WEINGARTNER HM, MATHEMATICAL PROGRAM