A decomposition based minimax regret approach for inverse multiple criteria sorting problem
From MaRDI portal
Publication:2688883
DOI10.1007/s10288-022-00505-5OpenAlexW4225747931MaRDI QIDQ2688883
Özgür Özpeynirci, Vincent Mousseau, Selin Özpeynirci
Publication date: 6 March 2023
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-022-00505-5
Cites Work
- Post factum analysis for robust multiple criteria ranking and sorting
- Multiple criteria sorting with a set of additive value functions
- An axiomatic approach to noncompensatory sorting methods in MCDM. I: The case of two categories
- A review of interactive methods for multiobjective integer and mixed-integer programming
- Novel types of sensitivity analysis for additive MCDM methods
- Multicriteria classification and sorting methods: A literature review
- An interactive algorithm for multiple criteria constrained sorting problem
- Combining local search and elicitation for multi-objective combinatorial optimization
- Constraint-based optimization and utility elicitation using the minimax decision criterion
- Learning the Parameters of a Multiple Criteria Sorting Method
- Regret in Decision Making under Uncertainty
- An axiomatic approach to noncompensatory sorting methods in MCDM. II: M ore than two categories
This page was built for publication: A decomposition based minimax regret approach for inverse multiple criteria sorting problem
