共 50 条
- [41] Solving 0-1 Knapsack Problems by Greedy Method and Dynamic Programming Method ADVANCED RESEARCH ON MATERIAL ENGINEERING, CHEMISTRY AND BIOINFORMATICS, PTS 1 AND 2 (MECB 2011), 2011, 282-283 : 570 - 573
- [42] Analysis of characteristics of the local search method in the process of solving the knapsack optimization problem in the decision support systems INTERNATIONAL WORKSHOP ADVANCED TECHNOLOGIES IN MATERIAL SCIENCE, MECHANICAL AND AUTOMATION ENGINEERING - MIP: ENGINEERING - 2019, 2019, 537
- [44] A new approach for solving 0/1 knapsack problem 2006 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-6, PROCEEDINGS, 2006, : 3138 - +
- [45] Optimal Strategy for Solving a Special Case of the Knapsack Problem by the Branch and Bound Method Moscow University Mathematics Bulletin, 2021, 76 : 97 - 106
- [46] New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem HYBRID METAHEURISTICS, 2010, 6373 : 118 - +
- [49] A discrete cuckoo search algorithm for solving knapsack problems Advances in Information Sciences and Service Sciences, 2012, 4 (18): : 331 - 339