A branch and bound algorithm for Choquet optimization in multicriteria problems

DOI10.1007/978-3-642-04045-0_30MaRDI QIDQ3556576zbMATHOpenAlexFDO

Authors Lucie Galand, Patrice Perny, Olivier Spanjaard

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

Choquet integralknapsack problembranch and boundminimal spanning tree problemmulticriteria combinatorial optimization

Mathematics Subject Classification ID

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

Recommendations

• Choquet-based optimisation in multiobjective shortest path and spanning tree problems
• Choquet optimal set in biobjective combinatorial optimization
• A lower bound of the Choquet integral integrated within martins' algorithm
• New computational models for the Choquet integral
• Publication:4504075

Cited in

(14)

• Optimising a nonlinear utility function in multi-objective integer programming
• Knapsack problems with dependencies through non-additive measures and Choquet integral
• scientific article; zbMATH DE number 1488101 (Why is no real title available?)
• Choquet-based optimisation in multiobjective shortest path and spanning tree problems
• Compact versus noncompact LP formulations for minimizing convex Choquet integrals
• Choquet integral optimisation with constraints and the buoyancy property for fuzzy measures
• 2-additive Choquet optimal solutions in multiobjective optimization problems
• Maximization of the Choquet integral over a convex set and its application to resource allocation problems
• A new algorithm for the multi-item exponentially discounted optimal selection problem.
• A lower bound of the Choquet integral integrated within martins' algorithm
• Choquet Optimization Using GAI Networks for Multiagent/Multicriteria Decision-Making
• Choquet optimal set in biobjective combinatorial optimization
• A new node selection strategy in the branch-and-bound procedure
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3556576)