共 50 条
- [1] 0-1 MULTIDIMENSIONAL KNAPSACK-PROBLEMS - 0-1 OPTIMIZATION OF BOUNDS ON THE SUM OF VARIABLES [J]. RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 1993, 27 (02): : 249 - 264
- [3] Solving 0-1 Knapsack Problems by Greedy Method and Dynamic Programming Method [J]. ADVANCED RESEARCH ON MATERIAL ENGINEERING, CHEMISTRY AND BIOINFORMATICS, PTS 1 AND 2 (MECB 2011), 2011, 282-283 : 570 - 573
- [6] ALGORITHM FOR 0-1 MULTIPLE-KNAPSACK PROBLEMS [J]. NAVAL RESEARCH LOGISTICS, 1978, 25 (03) : 571 - 579
- [7] Local Cuts for 0-1 Multidimensional Knapsack Problems [J]. DATA AND DECISION SCIENCES IN ACTION, 2018, : 81 - 89
- [8] MATROIDAL RELAXATIONS FOR 0-1 KNAPSACK-PROBLEMS [J]. OPERATIONS RESEARCH LETTERS, 1993, 14 (03) : 147 - 152
- [10] On the adoption of Metaheuristics for Solving 0-1 Knapsack Problems [J]. PAAP 2021: 2021 12TH INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS AND PROGRAMMING, 2021, : 56 - 61