Optimization problems with uncertain objective coefficients using capacities

DOI10.1007/S10479-024-06331-8MaRDI QIDQ7028084zbMATH OpenFDO

Authors Tuan-Anh Vu, Sohaib Afifi, Éric Lefèvre, Frédéric Pichon

Publication date 12 February 2025

Published in Annals of Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10479-024-06331-8

zbMATH Keywords

2-monotone capacitiescoherent lower probabilitiescombinatorial optimizationconvex optimizationdecision makingmulti-objective optimization

Mathematics Subject Classification ID

Convex programming (90C25) Combinatorial optimization (90C27) Multi-objective and goal programming (90C29) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)

Cites work

• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• A survey of decision making and optimization under uncertainty
• Additive representations of non-additive measures and the Choquet integral
• Biobjective optimization problems on matroids with binary costs
• Constrained optimization problems under uncertainty with coherent lower previsions
• Convex Analysis
• Coxeter matroids. With illustrations by Anna Borovik
• Decision making under uncertainty using imprecise probabilities
• Decision-making with belief functions: a review
• Discrete optimization with interval data. Minmax regret and fuzzy approach
• Geometric algorithms and combinatorial optimization.
• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 4070651 (Why is no real title available?)
• scientific article; zbMATH DE number 48344 (Why is no real title available?)
• scientific article; zbMATH DE number 193123 (Why is no real title available?)
• scientific article; zbMATH DE number 3560492 (Why is no real title available?)
• scientific article; zbMATH DE number 1416629 (Why is no real title available?)
• scientific article; zbMATH DE number 3422402 (Why is no real title available?)
• Introduction to imprecise probabilities
• Maximization of the Choquet integral over a convex set and its application to resource allocation problems
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Minimax regret solution to linear programming problems with an interval objective function
• Multicriteria Optimization
• Multiobjective linear programming. An introduction
• On extreme points of p-boxes and belief functions
• On matroids with multiple objectives
• On the enumeration of non-dominated spanning trees with imprecise weights
• Optimization problems with evidential linear objective
• Robust optimization with belief functions
• Robustness analysis in decision aiding, optimization, and analytics
• Sequential decision making with partially ordered preferences
• Set functions, games and capacities in decision making
• Some characterizations of lower probabilities and other monotone capacities through the use of Möbius inversion
• The capacitated vehicle routing problem with evidential demands
• The vehicle routing problem with time windows and evidential service and travel times: a recourse model

This page was built for publication: Optimization problems with uncertain objective coefficients using capacities

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