On a cardinality constrained multicriteria knapsack problem



We consider a variant of a knapsack problem with a fixed cardinaliity constraint. There are three objective functions to be optimized: one real-valued and two integer-valued objectives. We show that this problem can be solved efficiently by a local search. The algorithm utilizes connectedness of a subset of feasible solutions and has optimal run-time.

Cited by

No citations found