Robust and neutral methods for aggregating preferences into an outranking relation
From MaRDI portal
Publication:1806918
DOI10.1016/S0377-2217(97)00439-6zbMath0944.91015OpenAlexW2062859087MaRDI QIDQ1806918
Publication date: 26 September 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00439-6
Related Items (7)
A decision-theoretic approach to robust optimization in multivalued graphs ⋮ About the applicability of MCDA to some robustness problems ⋮ On the concept of decision aiding process: an operational perspective ⋮ Outranking under uncertainty using scenarios ⋮ On the (numerical) ranking associated with any finite binary relation ⋮ Robustness in Multi-criteria Decision Aiding ⋮ Robustness in operational research and decision aiding: a multi-faceted issue
Cites Work
- Unnamed Item
- Exploitation of a crisp relation in a ranking problem
- Ranking methods based on valued preference relations. A characterization of the net flow method
- Ranking methods for valued preference relations: A characterization of a method based on leaving and entering flows
- Robust discrete optimization and its applications
- A characterization of ‘min’ as a procedure for exploiting valued preference relations and related results
This page was built for publication: Robust and neutral methods for aggregating preferences into an outranking relation
