Dynamic programming with ordered structures: Theory, examples and applications
From MaRDI portal
Recommendations
- Ordered Solutions for Dynamic Programs
- Axioms and Examples Related to Ordinal Dynamic Programming
- Dynamic programming and d-graphs
- scientific article; zbMATH DE number 49715
- Generalizations and applications of a class of dynamic programming problems
- scientific article; zbMATH DE number 3871062
- scientific article; zbMATH DE number 53073
- scientific article; zbMATH DE number 5866260
- scientific article; zbMATH DE number 1260458
- scientific article; zbMATH DE number 1431652
Cites work
- A new pricing scheme for a multi-period pool-based electricity auction
- A parametric total order on fuzzy numbers and a fuzzy shortest route problem
- A time-dependent multiple criteria single-machine scheduling problem
- Ant algorithms and simulated annealing for multicriteria dynamic programming
- Default reasoning and possibility theory
- Discrete dynamic programming with outcomes in random variable structures
- Dynamic programming in multiplicative lattices
- Equity measurement in facility location analysis: A review and framework
- scientific article; zbMATH DE number 994348 (Why is no real title available?)
- scientific article; zbMATH DE number 51639 (Why is no real title available?)
- scientific article; zbMATH DE number 1858044 (Why is no real title available?)
- scientific article; zbMATH DE number 3204690 (Why is no real title available?)
- scientific article; zbMATH DE number 3222127 (Why is no real title available?)
- Inequality measures and equitable approaches to location problems
- Pareto optimal allocations and dynamic programming
- Preference Order Dynamic Programming
- Pseudo-analysis and its application in railway routing
- Reasonable properties for the ordering of fuzzy quantities. II
- Rough approximation of a preference relation by a multi-attribute dominance for deterministic, stochastic and fuzzy decision problems
- Solving efficiently the 0-1 multi-objective knapsack problem
- Stochastic ordering of random processes with an imbedded point process
- The Principle of Optimality in Dynamic Programming with Returns in Partially Ordered Sets
Cited in
(7)- Compromise programming with Tchebycheff norm for discrete stochastic orders
- Axioms and Examples Related to Ordinal Dynamic Programming
- Interactive procedure for a multiobjective stochastic discrete dynamic problem
- Ordered Solutions for Dynamic Programs
- scientific article; zbMATH DE number 1858044 (Why is no real title available?)
- Multiple criteria dynamic programming and multiple knapsack problem
- Discrete dynamic programming with outcomes in random variable structures
This page was built for publication: Dynamic programming with ordered structures: Theory, examples and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q622035)