## On a Cardinality Constrained Multicriteria Knapsack Problem

• We consider a variant of a knapsack problem with a fixed cardinality 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.

### Additional Services

Author: Florian Seipp, Stefan Ruzika, Luis Paquete urn:nbn:de:hbz:386-kluedo-16817 Report in Wirtschaftsmathematik (WIMA Report) (133) Preprint English 2011 2011 Technische Universität Kaiserslautern Knapsack problem ; combinatorial optimization ; connectedness ; local search algorithm; multicriteria optimization Fachbereich Mathematik 510 Mathematik

$Rev: 12793$