Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Two-phases Method and Branch and Bound Procedures to Solve the Bi–objective Knapsack Problem
Journal of Global Optimization
Multicriteria Optimization
Constrained optimization using multiple objective programming
Journal of Global Optimization
Solving efficiently the 0-1 multi-objective knapsack problem
Computers and Operations Research
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
Multidimensional Knapsack Problem: A Fitness Landscape Analysis
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Solving sequential knapsack problems
Operations Research Letters
Multicriteria 0-1 knapsack problems with k-min objectives
Computers and Operations Research
On local search for bi-objective knapsack problems
Evolutionary Computation
Hi-index | 0.01 |
In this article we identify a class of two-dimensional knapsack problems with binary weights and related three-criteria unconstrained combinatorial optimization problems that can be solved in polynomial time by greedy algorithms. Starting from the knapsack problem with two equality constraints we show that this problem can be solved efficiently by using an appropriate partitioning of the items with respect to their binary weights. Based on the results for this problem we derive an algorithm for the three-criteria unconstrained combinatorial optimization problem with two binary objectives that explores the connectedness of the set of efficient knapsacks with respect to a combinatorial definition of adjacency. Furthermore, we prove that our approach is asymptotically optimal and provide extensive computational experiments that shows that we can solve the three-criteria problem with up to one million items in less than half an hour. Finally, we derive an efficient algorithm for the two-dimensional knapsack problems with binary constraints that only takes into account the results we obtained for the unconstrained three-criteria problem with binary weights.