A branch and bound algorithm for Choquet optimization in multicriteria problems

DOI10.1007/978-3-642-04045-0_30zbMATH Open1184.90138OpenAlexW1590586624MaRDI QIDQ3556576FDOQ3556576

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

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

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)

Cited In (14)

• Title not available (Why is that?)
• Choquet-based optimisation in multiobjective shortest path and spanning tree problems
• Choquet Optimization Using GAI Networks for Multiagent/Multicriteria Decision-Making
• A new algorithm for the multi-item exponentially discounted optimal selection problem.
• 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
• A lower bound of the Choquet integral integrated within martins' algorithm
• Knapsack problems with dependencies through non-additive measures and Choquet integral
• 2-additive Choquet optimal solutions in multiobjective optimization problems
• Exact algorithms for OWA-optimization in multiobjective spanning tree problems
• Choquet optimal set in biobjective combinatorial optimization
• Choquet integral optimisation with constraints and the buoyancy property for fuzzy measures
• A new node selection strategy in the branch-and-bound procedure
• Compact versus noncompact LP formulations for minimizing convex Choquet integrals

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)