AN ENUMERATION ALGORITHM FOR KNAPSACK PROBLEMS

被引：40
|
作者：
CABOT, AV
机构：
来源：
OPERATIONS RESEARCH | 1970年 / 18卷 / 02期
关键词：
D O I：
10.1287/opre.18.2.306
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：306 / &
相关论文
共 50 条
  • [21] Quantum-inspired ant algorithm for knapsack problems
    Wang Honggang
    JournalofSystemsEngineeringandElectronics, 2009, 20 (05) : 1012 - 1016
  • [22] A penalty algorithm for solving convex separable knapsack problems
    Hoto, R. S., V
    Matioli, L. C.
    Santos, P. S. M.
    APPLIED MATHEMATICS AND COMPUTATION, 2020, 387
  • [23] AES algorithm for Dynamic Knapsack Problems in Capital Budgeting
    Cui, Xiaoling
    Wang, Dazhi
    Yan, Yang
    2010 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-5, 2010, : 481 - +
  • [24] Binary artificial algae algorithm for multidimensional knapsack problems
    Zhang, Xuedong
    Wu, Changzhi
    Li, Jing
    Wang, Xiangyu
    Yang, Zhijing
    Lee, Jae-Myung
    Jung, Kwang-Hyo
    APPLIED SOFT COMPUTING, 2016, 43 : 583 - 595
  • [25] A partial enumeration algorithm for solving PNS problems
    Holló, C
    MATHEMATICAL AND COMPUTER MODELLING, 2003, 38 (7-9) : 855 - 864
  • [26] An Exact Algorithm for Bilevel 0-1 Knapsack Problems
    Mansi, Raid
    Alves, Claudio
    de Carvalho, J. M. Valerio
    Hanafi, Said
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2012, 2012
  • [27] A branch-and-bound algorithm for hard multiple knapsack problems
    Fukunaga, Alex S.
    ANNALS OF OPERATIONS RESEARCH, 2011, 184 (01) : 97 - 119
  • [28] Quantum-Inspired Evolutionary Algorithm for difficult knapsack problems
    C. Patvardhan
    Sulabh Bansal
    Anand Srivastav
    Memetic Computing, 2015, 7 : 135 - 155
  • [29] AN ALGORITHM FOR LARGE ZERO-ONE KNAPSACK-PROBLEMS
    BALAS, E
    ZEMEL, E
    OPERATIONS RESEARCH, 1980, 28 (05) : 1130 - 1154
  • [30] ALGORITHM FOR 0-1 MULTIPLE-KNAPSACK PROBLEMS
    HUNG, MS
    FISK, JC
    NAVAL RESEARCH LOGISTICS, 1978, 25 (03) : 571 - 579
12345