Exploitation of a crisp relation in a ranking problem
From MaRDI portal
Recommendations
- Ranking Alternatives on the Basis of Preference Relations: A Progress Report with Special Emphasis on Outranking Relations
- Outranking Relations: Do They Have Special Properties?
- Extensions of the prudence principle to exploit a valued outranking relation
- Note—A Preference Ranking Organisation Method
- An axiomatic analysis of concordance-discordance relations
Cites work
Cited in
(17)- Extensions of the prudence principle to exploit a valued outranking relation
- A real-world MCDA application: evaluating software
- Outranking Relations: Do They Have Special Properties?
- A consolidated approach to the axiomatization of outranking relations: a survey and new results
- Bipolar preference modeling and aggregation in decision support
- Deriving a final ranking from fuzzy preferences: An approach compatible with the principle of correspondence
- Computer science and decision theory
- On the (numerical) ranking associated with any finite binary relation
- Argumentation theory and decision aiding
- Variable consistency dominance-based rough set approach to preference learning in multicriteria ranking
- Bi-oriented graphs and four valued logic for preference modelling
- A note on the asymmetric part of an outranking relation
- Consistent union and prioritized consistent union: new operations for preference aggregation
- Robust and neutral methods for aggregating preferences into an outranking relation
- ELECTRE: A comprehensive literature review on methodologies and applications
- Une typologie des méthodes multicritères: Proposition d'un cadre méthodologique
- A general decomposition approach for multi-criteria decision trees
This page was built for publication: Exploitation of a crisp relation in a ranking problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1193764)
