A Branch and Bound Algorithm for Choquet Optimization in Multicriteria Problems

DOI10.1007/978-3-642-04045-0_30zbMath1184.90138OpenAlexW1590586624MaRDI QIDQ3556576

Olivier Spanjaard, Lucie Galand, Patrice Perny

Publication date: 24 April 2010

Published in: Lecture Notes in Economics and Mathematical Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04045-0_30

zbMATH Keywords

branch and boundChoquet integralknapsack problemminimal spanning tree problemmulticriteria 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 (6)

Knapsack problems with dependencies through non-additive measures and Choquet integral ⋮ Choquet optimal set in biobjective combinatorial optimization ⋮ Choquet integral optimisation with constraints and the buoyancy property for fuzzy measures ⋮ Optimising a nonlinear utility function in multi-objective integer programming ⋮ Maximization of the Choquet integral over a convex set and its application to resource allocation problems ⋮ Exact algorithms for OWA-optimization in multiobjective spanning tree problems

This page was built for publication: A Branch and Bound Algorithm for Choquet Optimization in Multicriteria Problems