• search hit 1 of 1
Back to Result List

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.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Author:Florian Seipp, Stefan Ruzika, Luis Paquete
URN (permanent link):urn:nbn:de:hbz:386-kluedo-16817
Serie (Series number):Report in Wirtschaftsmathematik (WIMA Report) (133)
Document Type:Preprint
Language of publication:English
Year of Completion:2011
Year of Publication:2011
Publishing Institute:Technische Universität Kaiserslautern
Date of the Publication (Server):2011/02/08
Tag:Knapsack problem; combinatorial optimization; connectedness; local search algorithm; multicriteria optimization
Faculties / Organisational entities:Fachbereich Mathematik
DDC-Cassification:5 Naturwissenschaften und Mathematik / 510 Mathematik
Licence (German):Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011