A general decomposition approach for multi-criteria decision trees
type: Item
instance of: scholarly article
title: A general decomposition approach for multi-criteria decision trees
zbMATH Open document ID: 1253.91049
author: Anissa Frini
author: A. Guitouni
author: Jean-Marc Martel
published in: European Journal of Operational Research
publication date: 2012-12-29T00:00:00Z
Mathematics Subject Classification ID: 91B06
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 6119376
zbMATH Keywords: multi-criteria decision tree
zbMATH Keywords: dynamic programming
zbMATH Keywords: decomposition principle
zbMATH Keywords: best compromise strategies
zbMATH Keywords: MCDA methods
describes a project that uses: ELECTRE
MaRDI profile type: Publication
full work available at URL: j.ejor.2012.01.032
OpenAlex ID: W2013043413
cites work: Model choice in multicriteria decision aid
cites work: Stochastic optimal control. The discrete time case
cites work: Q4209222
cites work: Dynamic programming and stochastic control
cites work: Some remarks on the notion of compensation in MCDM
cites work: Dynamic programming in multiplicative lattices
cites work: Q3688086
cites work: Generalized dynamic programming for multicriteria optimization
cites work: General Theory of Optimal Processes
cites work: Optimal Systems with Multiple Cost Functionals
cites work: A bicriterion shortest path algorithm
cites work: Constrained minimization under vector-valued criteria in finite dimensional spaces
cites work: Q5569992
cites work: Q4226070
cites work: Q3888874
cites work: The shortest path problem with two objective functions
cites work: Efficient Interactive Methods for a Class of Multiattribute Shortest Path Problems
cites work: Q3266141
cites work: Multiple attribute decision making. Methods and applications. A state-of- the-art survey
cites work: Preference Order Dynamic Programming
cites work: Choosing The “Best” Multiple Criterlv Decision-Making Method
cites work: Theoretical elements of comparison among ordinal discrete multicriteria methods
cites work: A Common Framework for Describing Some Outranking Methods
cites work: Q4156063
cites work: Ordinal Dynamic Programming
cites work: Multiobjective, preference-based search in acyclic OR-graphs
cites work: Exploitation of a crisp relation in a ranking problem
DOI: 10.1016/J.EJOR.2012.01.032
description: scientific article; zbMATH DE number 6119376