Preferential reducts and constructs in robust multiple criteria ranking and sorting
DOI10.1007/s00291-014-0361-zzbMath1305.91081OpenAlexW2077266255WikidataQ59395536 ScholiaQ59395536MaRDI QIDQ480786
Miłosz Kadziński, Salvatore Corrente, Greco, Salvatore, Slowinski, Roman
Publication date: 11 December 2014
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-014-0361-z
explanationmultiple criteria decision aidingrobust ordinal regressionadditive value functionincomplete/partial informationranking problemsorting problem
Decision theory (91B06) Management decision making, including multiple objectives (90B50) General considerations in statistical decision theory (62C05)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Learning non-monotonic additive value functions for multicriteria decision making
- Multiple criteria sorting with a set of additive value functions
- A general framework for explaining the results of a multi-attribute preference model
- Using arguments for making and explaining decisions
- Dealing with inconsistent judgments in multiple criteria sorting models
- Ordinal regression revisited: Multiple criteria ranking using a set of additive value functions
- Multiobjective optimization. Interactive and evolutionary approaches
- Non-additive robust ordinal regression: a multiple criteria decision model based on the Choquet integral
- Irreducibly inconsistent systems of linear inequalities
- Assessing a set of additive utility functions for multicriteria decision- making, the UTA method
- MINOS(IIS): Infeasibility analysis using MINOS
- Some results concerning post-infeasibility analysis
- Resolving inconsistencies among constraints on the parameters of an MCDA model
- Axiomatic characterization of a general utility function and its particular cases in terms of conjoint measurement and rough-set decision rules
- The shape of the utility or value function in stochastic multicriteria acceptability analysis
- Robust ordinal regression in preference learning and ranking
- ELECTRE\(^{\text{GKMS}}\): Robust ordinal regression for outranking methods
- A note on resolving infeasibility in linear programs by constraint relaxation
- Building a set of additive value functions representing a reference preorder and intensities of preference: GRIP method
- Feasibility and infeasibility in optimization. Algorithms and computational methods.
- Detecting IIS in infeasible linear programmes using techniques from goal programming
- Fast Heuristics for the Maximum Feasible Subsystem Problem
- Argumentation Theory and Decision Aiding
- Minimal and Complete Explanations for Critical Multi-attribute Decisions
- Multiple Criteria Decision Making, Multiattribute Utility Theory: Recent Accomplishments and What Lies Ahead
- Preference Learning
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
- Preference disaggregation: 20 years of MCDA experience.
- Ranking multicriteria alternatives: The method ZAPROS III
This page was built for publication: Preferential reducts and constructs in robust multiple criteria ranking and sorting