Choquet-based optimisation in multiobjective shortest path and spanning tree problems
From MaRDI portal
Publication:2655619
DOI10.1016/j.ejor.2009.10.015zbMath1178.90333OpenAlexW2110660895MaRDI QIDQ2655619
Patrice Perny, Olivier Spanjaard, Lucie Galand
Publication date: 25 January 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://basepub.dauphine.fr/handle/123456789/6079
Choquet integralminimum spanning tree problemshortest path problemsubmodular capacitymultiobjective discrete optimisation
Related Items (17)
Knapsack problems with dependencies through non-additive measures and Choquet integral ⋮ Choquet optimal set in biobjective combinatorial optimization ⋮ An efficient procedure for finding best compromise solutions to the multi-objective assignment problem ⋮ Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment ⋮ Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points ⋮ Incremental elicitation of Choquet capacities for multicriteria choice, ranking and sorting problems ⋮ Enumerating \(K\) best paths in length order in DAGs ⋮ Choquet integral optimisation with constraints and the buoyancy property for fuzzy measures ⋮ Using the WOWA operator in robust discrete optimization problems ⋮ Incremental preference elicitation with bipolar Choquet integrals ⋮ Optimising a nonlinear utility function in multi-objective integer programming ⋮ Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion ⋮ Combinatorial optimization problems with uncertain costs and the OWA criterion ⋮ Ordered weighted average optimization in multiobjective spanning tree problem ⋮ Maximization of the Choquet integral over a convex set and its application to resource allocation problems ⋮ Empirical study of exact algorithms for the multi-objective spanning tree ⋮ A Lower Bound of the Choquet Integral Integrated Within Martins’ Algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Diversification, convex preferences and non-empty core in the Choquet expected utility model.
- On a multicriteria shortest path problem
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Algorithms for finding k-best perfect matchings
- k-optimal solution sets for some polynomially solvable scheduling problems
- Multiple criteria decision making, theory and application. Proceedings of the third conference Hagen/Königswinter, West Germany, August 20-24, 1979
- The application of fuzzy integrals in multicriteria decision making
- On spanning tree problems with multiple objectives
- Robust discrete optimization and its applications
- On the robust shortest path problem.
- Multiple criteria optimization: State of the art annotated bibliographic surveys
- An implementation of Shor's \(r\)-algorithm
- Inequality measures and equitable approaches to location problems
- Multicriteria optimization
- A note on \(K\) best network flows
- A decision-theoretic approach to robust optimization in multivalued graphs
- Cores of convex games
- Submodular functions and optimization.
- Theory of capacities
- ON THE MAXIMUM-ENTROPY PROBABILITY WHICH IS CONSISTENT WITH A CONVEX CAPACITY
- The weighted OWA operator
- On ordered weighted averaging aggregation operators in multicriteria decisionmaking
- Subjective Probability and Expected Utility without Additivity
- An Algorithm for Finding K Minimum Spanning Trees
- Solving min-max shortest-path problems on a network
- Two Algorithms for Generating Weighted Spanning Trees in Order
- Integral Representation Without Additivity
- Finding the k Shortest Paths
- Robust solutions and methods in decision-aid
- The determination of the path with minimum-cost norm value
- The Dual Theory of Choice under Risk
- An interactive weighted Tchebycheff procedure for multiple objective programming
This page was built for publication: Choquet-based optimisation in multiobjective shortest path and spanning tree problems
