Preference Order Dynamic Programming
From MaRDI portal
Cited in
(20)- Decomposition of multiple criteria mathematical programming problems by dynamic programming
- GENERALIZED FUNDAMENTAL EQUATION IN PANSYSTEMS NETWORK ANALYSIS
- Folk theorems in multicriteria repeated \(N\)-person games.
- Generalized dynamic programming for multicriteria optimization
- Multicriteria dynamic programming with an application to the integer case
- Some comments on preference order dynamic programming models
- An improved interactive hybrid method for the linear multi-objective knapsack problem
- Multiobjective management of mining under water hazard by game theory
- Pareto optimal allocations and dynamic programming
- Multiple objectives and non-separability in stochastic dynamic programming
- The shortest path problem with two objective functions
- An interactive dynamic programming approach to multicriteria discrete programming
- Empirical working time distribution-based line balancing with integrated simulated annealing and dynamic programming
- Dynamic programming and principles of optimality
- Percentiles and Markovian decision processes
- A general decomposition approach for multi-criteria decision trees
- Interactive procedure for a multiobjective stochastic discrete dynamic problem
- Dynamic programming with ordered structures: Theory, examples and applications
- Theory and applications of generalized dynamic programming: An overview
- Discrete dynamic programming with outcomes in random variable structures
This page was built for publication: Preference Order Dynamic Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4060646)
