EXTENSION OF A METHOD BY KRAWCZYK TO SOLVE KNAPSACK PROBLEMS WITH 0-1 VARIABLES

被引：0
|
作者：
BRAUN, H [1 ]
机构：
[1] EIDGENOSS TH,INST OPERATIONS RES,ZURICH 8006,SWITZERLAND
来源：
ANGEWANDTE INFORMATIK | 1973年 / 1卷
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：25 / 28
页数：4
相关论文
共 50 条
  • [1] 0-1 MULTIDIMENSIONAL KNAPSACK-PROBLEMS - 0-1 OPTIMIZATION OF BOUNDS ON THE SUM OF VARIABLES
    BUI, M
    RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 1993, 27 (02): : 249 - 264
  • [2] Tolerance analysis for 0-1 knapsack problems
    Pisinger, David
    Saidi, Alima
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 258 (03) : 866 - 876
  • [3] Solving 0-1 Knapsack Problems by Greedy Method and Dynamic Programming Method
    Liu, Lu
    ADVANCED RESEARCH ON MATERIAL ENGINEERING, CHEMISTRY AND BIOINFORMATICS, PTS 1 AND 2 (MECB 2011), 2011, 282-283 : 570 - 573
  • [4] Binary Aquila Optimizer for 0-1 knapsack problems
    Bas, Emine
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2023, 118
  • [5] 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
  • [6] ALGORITHM FOR 0-1 MULTIPLE-KNAPSACK PROBLEMS
    HUNG, MS
    FISK, JC
    NAVAL RESEARCH LOGISTICS, 1978, 25 (03) : 571 - 579
  • [7] Local Cuts for 0-1 Multidimensional Knapsack Problems
    Gu, Hanyu
    DATA AND DECISION SCIENCES IN ACTION, 2018, : 81 - 89
  • [8] An exact algorithm for 0-1 polynomial knapsack problems
    Sun, Xiaoling
    Sheng, Hongbo
    Li, Duan
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2007, 3 (02) : 223 - 232
  • [9] MATROIDAL RELAXATIONS FOR 0-1 KNAPSACK-PROBLEMS
    AMADO, L
    BARCIA, P
    OPERATIONS RESEARCH LETTERS, 1993, 14 (03) : 147 - 152
  • [10] On the adoption of Metaheuristics for Solving 0-1 Knapsack Problems
    Qiu, Yang
    Li, Haomiao
    Wang, Xiao
    Dib, Omar
    PAAP 2021: 2021 12TH INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS AND PROGRAMMING, 2021, : 56 - 61
12345