A decision-theoretic approach to robust optimization in multivalued graphs
From MaRDI portal
Publication:2379879
DOI10.1007/s10479-006-0073-0zbMath1189.90020OpenAlexW2057223621MaRDI QIDQ2379879
Olivier Spanjaard, Patrice Perny, Louis-Xavier Storme
Publication date: 23 March 2010
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-006-0073-0
Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10)
Related Items (18)
Robust Decisions under Risk for Imprecise Probabilities ⋮ Choquet-based optimisation in multiobjective shortest path and spanning tree problems ⋮ Conditional median as a robust solution concept for uncapacitated location problems ⋮ Generalized equitable preference in multiobjective programming ⋮ Decision making with multiple objectives using GAI networks ⋮ Lorenz dominance based algorithms to solve a practical multiobjective problem ⋮ Portfolio optimization with \(pw\)-robustness ⋮ A survey of decision making and optimization under uncertainty ⋮ Lexicographicα-robustness: an application to the 1-median problem ⋮ A unified approach to uncertain optimization ⋮ Exact algorithms for OWA-optimization in multiobjective spanning tree problems ⋮ Tail mean and related robust solution concepts ⋮ Game theory based evolutionary algorithms: a review with Nash applications in structural engineering optimization problems ⋮ Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts ⋮ A survey of resource constrained shortest path problems: Exact solution approaches ⋮ A unified approach for different concepts of robustness and stochastic programming via non-linear scalarizing functionals ⋮ New multi-objective method to solve reentrant hybrid flow shop scheduling problem ⋮ Robustness in operational research and decision aiding: a multi-faceted issue
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- About the applicability of MCDA to some robustness problems
- Algorithms for finding k-best perfect matchings
- k-optimal solution sets for some polynomially solvable scheduling problems
- Generalized Gini inequality indices
- A bicriterion shortest path algorithm
- On spanning tree problems with multiple objectives
- Robust discrete optimization and its applications
- On the robust shortest path problem.
- Inequality measures and equitable approaches to location problems
- Robust and neutral methods for aggregating preferences into an outranking relation
- Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
- Equitable aggregations and multiple criteria analysis
- Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints
- An exact algorithm for the robust shortest path problem with interval data
- A note on \(K\) best network flows
- Multicriteria methodology for decision aiding. Transl. from the French by Mark R. McCord
- Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems
- On ordered weighted averaging aggregation operators in multicriteria decisionmaking
- Solving min-max shortest-path problems on a network
- An Induction Theorem for Rearrangements
- Two Algorithms for Generating Weighted Spanning Trees in Order
- Finding the k Shortest Paths
- Robust solutions and methods in decision-aid
- Multiobjective A*
- Linear optimization with multiple equitable criteria
- The Dual Theory of Choice under Risk
- An Axiomatic Approach to Measurable Utility
- Inequalities: theory of majorization and its applications
- The robust spanning tree problem with interval data
This page was built for publication: A decision-theoretic approach to robust optimization in multivalued graphs
