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

DOI10.1007/978-3-642-24873-3_3zbMath1233.90237OpenAlexW14838742MaRDI QIDQ3095289

Paul Weng, Olivier Spanjaard, Charles Delort

Publication date: 28 October 2011

Published in: Algorithmic Decision Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24873-3_3

zbMATH Keywords

polynomial algorithmsmultiobjective combinatorial optimizationcommittee selectionknapsack with cardinality constraintordinal combinatorial optimization

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items (3)

Ordinal optimization through multi-objective reformulation ⋮ How hard is it to tell which is a Condorcet committee? ⋮ Borda-induced hedonic games with friends, enemies, and neutral players

This page was built for publication: Committee Selection with a Weight Constraint Based on a Pairwise Dominance Relation