Skip to Main content Skip to Navigation
Conference papers

Committee Selection with a Weight Constraint Based on a Pairwise Dominance Relation

Charles Delort 1 Olivier Spanjaard 1 Paul Weng 1
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : This paper is devoted to a knapsack problem with a cardinality constraint when dropping the assumption of additive representability [10]. More precisely, we assume that we only have a classification of the items into ordered classes. We aim at generating the set of preferred subsets of items, according to a pairwise dominance relation between subsets that naturally extends the ordering relation over classes [4,16]. We first show that the problem reduces to a multiobjective knapsack problem with cardinality constraint. We then propose two polynomial algorithms to solve it, one based on a multiobjective dynamic programming scheme and the other on a multiobjective branch and bound procedure. We conclude by providing numerical tests to compare both approaches.
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download
Contributor : Lip6 Publications <>
Submitted on : Monday, July 10, 2017 - 4:40:10 PM
Last modification on : Thursday, March 21, 2019 - 1:21:21 PM
Document(s) archivé(s) le : Wednesday, January 24, 2018 - 5:20:41 PM


Files produced by the author(s)



Charles Delort, Olivier Spanjaard, Paul Weng. Committee Selection with a Weight Constraint Based on a Pairwise Dominance Relation. 2nd International Conference on Algorithmic Decision Theory (ADT'11), Oct 2011, Piscataway, NJ, United States. pp.28-41, ⟨10.1007/978-3-642-24873-3_3⟩. ⟨hal-01285704⟩



Record views


Files downloads