A general decomposition approach for multi-criteria decision trees
From MaRDI portal
Publication:1926761
DOI10.1016/j.ejor.2012.01.032zbMath1253.91049MaRDI QIDQ1926761
Jean-Marc Martel, Anissa Frini, Adel Guitouni
Publication date: 29 December 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.01.032
dynamic programming; decomposition principle; best compromise strategies; MCDA methods; multi-criteria decision tree
Related Items
Multi-stage optimization of decision and inhibitory trees for decision tables with many-valued decisions, Bi-criteria optimization of decision trees with applications to data analysis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic programming and stochastic control
- Generalized dynamic programming for multicriteria optimization
- The shortest path problem with two objective functions
- Some remarks on the notion of compensation in MCDM
- Multiple attribute decision making. Methods and applications. A state-of- the-art survey
- Stochastic optimal control. The discrete time case
- A bicriterion shortest path algorithm
- Exploitation of a crisp relation in a ranking problem
- Multiobjective, preference-based search in acyclic OR-graphs
- Model choice in multicriteria decision aid
- Dynamic programming in multiplicative lattices
- Constrained minimization under vector-valued criteria in finite dimensional spaces
- Choosing The “Best” Multiple Criterlv Decision-Making Method
- Preference Order Dynamic Programming
- Ordinal Dynamic Programming
- Efficient Interactive Methods for a Class of Multiattribute Shortest Path Problems
- A Common Framework for Describing Some Outranking Methods
- Theoretical elements of comparison among ordinal discrete multicriteria methods
- General Theory of Optimal Processes
- Optimal Systems with Multiple Cost Functionals
