user

RESOLUTION OF 0-1 KNAPSACK PROBLEM - COMPARISON OF METHODS

被引：41
|
作者：
FAYARD, D [1 ]
PLATEAU, G [1 ]
机构：
[1] UNIV SCI & TECH LILLE,LILLE,FRANCE
来源：
MATHEMATICAL PROGRAMMING | 1975年 / 8卷 / 03期
关键词：
D O I：
10.1007/BF01580448
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：272 / 307
页数：36
相关论文
共 50 条
  • [31] Exact algorithm for the 0-1 collapsing knapsack problem
    Fayard, D.
    Plateau, G.
    [J]. 1600, (49): : 1 - 3
  • [32] A NEW ALGORITHM FOR THE 0-1 KNAPSACK-PROBLEM
    MARTELLO, S
    TOTH, P
    [J]. MANAGEMENT SCIENCE, 1988, 34 (05) : 633 - 644
  • [33] An improved monkey algorithm for a 0-1 knapsack problem
    Zhou, Yongquan
    Chen, Xin
    Zhou, Guo
    [J]. APPLIED SOFT COMPUTING, 2016, 38 : 817 - 830
  • [34] The 0-1 Knapsack problem with a single continuous variable
    Marchand, H
    Wolsey, LA
    [J]. MATHEMATICAL PROGRAMMING, 1999, 85 (01) : 15 - 33
  • [35] On the generalized fuzzy multiconstraint 0-1 knapsack problem
    Lin, Feng-Tse
    [J]. 2006 IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS, VOLS 1-5, 2006, : 984 - 989
  • [36] An new algorithm of solving 0-1 knapsack problem
    Tuo Shou-Heng
    [J]. 2011 INTERNATIONAL CONFERENCE ON FUTURE COMPUTER SCIENCE AND APPLICATION (FCSA 2011), VOL 1, 2011, : 543 - 546
  • [37] Linear programming for the 0-1 quadratic knapsack problem
    Billionnet, A
    Calmels, F
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 92 (02) : 310 - 325
  • [38] The 0-1 Knapsack problem with a single continuous variable
    Hugues Marchand
    Laurence A. Wolsey
    [J]. Mathematical Programming, 1999, 85 : 15 - 33
  • [39] A new class of hard problem instances for the 0-1 knapsack problem
    Jooken, Jorik
    Leyman, Pieter
    De Causmaecker, Patrick
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 301 (03) : 841 - 854
  • [40] Evolutionary and heuristic algorithms for multiobjective 0-1 knapsack problem
    Kumar, Rajeev
    Singh, R. K.
    Singhal, A. P.
    Bhartia, Atul
    [J]. APPLICATIONS OF SOFT COMPUTING: RECENT TRENDS, 2006, : 331 - +
12345