Compact versus noncompact LP formulations for minimizing convex Choquet integrals
From MaRDI portal
Publication:1759877
DOI10.1016/j.dam.2012.07.007zbMath1279.90118OpenAlexW2017502580MaRDI QIDQ1759877
Michel Minoux, Julien Lesca, Patrice Perny
Publication date: 22 November 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.07.007
Related Items (6)
Knapsack problems with dependencies through non-additive measures and Choquet integral ⋮ Computational social choice for coordination in agent networks ⋮ Incremental elicitation of Choquet capacities for multicriteria choice, ranking and sorting problems ⋮ Choquet integral optimisation with constraints and the buoyancy property for fuzzy measures ⋮ Ordered weighted average combinatorial optimization: formulations and their properties ⋮ The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases
This page was built for publication: Compact versus noncompact LP formulations for minimizing convex Choquet integrals
