A Branch and Bound Algorithm for Choquet Optimization in Multicriteria Problems
Authors:
- Lucie GalandLGLucie Galand
- Patrice PernyPPPatrice Perny
- Olivier SpanjaardOSOlivier Spanjaard
Open Access
- 21 October 2009
- book chapter
- Published by Springer Nature
- p. 355-365
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On Optimization of the Importance Weighted OWA Aggregation of Multiple Criteria2007
- Diversification, convex preferences and non-empty core in the Choquet expected utility modelEconomic Theory, 2002
- Minmax combinatorial optimizationEuropean Journal of Operational Research, 1995
- On spanning tree problems with multiple objectivesAnnals of Operations Research, 1994
- Beyond preference information based multiple criteria decision makingEuropean Journal of Operational Research, 1991
- The Dual Theory of Choice under RiskEconometrica, 1987
- Integral representation without additivityProceedings of the American Mathematical Society, 1986
- An upper bound for the zero-one knapsack problem and a branch and bound algorithmEuropean Journal of Operational Research, 1977
- Cores of convex gamesInternational Journal of Game Theory, 1971
- Theory of capacitiesAnnales de l'institut Fourier, 1954