Filtern
Erscheinungsjahr
- 2011 (1) (entfernen)
Dokumenttyp
- Preprint (1) (entfernen)
Sprache
- Englisch (1)
Volltext vorhanden
- ja (1)
Schlagworte
- Knapsack problem (1) (entfernen)
Fachbereich / Organisatorische Einheit
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.