Dynamic programming in multiplicative lattices
From MaRDI portal
Publication:2395595
DOI10.1016/0022-247X(65)90045-4zbMATH Open0132.40303OpenAlexW2008206724MaRDI QIDQ2395595FDOQ2395595
Authors: Yanyan Li
Publication date: 1965
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-247x(65)90045-4
Cites Work
Cited In (24)
- On a biobjective search problem in a line: formulations and algorithms
- An elimination condition to check the validity of the principle of optimality
- Ant algorithms and simulated annealing for multicriteria dynamic programming
- A trade-off multiobjective dynamic programming procedure and its application to project portfolio selection
- Decomposition methods in multiobjective discrete-time dynamic problems
- Dynamic programming approach to multiple objective control problem having deterministic or fuzzy goals
- Time Consistency of the Mean-Risk Problem
- A Dimension-Reduction Algorithm for Multi-Stage Decision Problems with Returns in a Partially Ordered Set
- Multicriteria dynamic programming with an application to the integer case
- A survey of vector optimization in infinite-dimensional spaces. II
- Title not available (Why is that?)
- Pareto optimal allocations and dynamic programming
- Pareto optimal policies for harvesting with multiple objectives
- Optimality conditions in nonconical multiple objective programming
- Existence and characterization of efficient decisions with respect to cones
- Multiple objectives and non-separability in stochastic dynamic programming
- Adaptive differential dynamic programming for multiobjective optimal control
- The shortest path problem with two objective functions
- Extensions of labeling algorithms for multi‐objective uncertain shortest path problems
- 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
- Multiple criteria dynamic programming and multiple knapsack problem
This page was built for publication: Dynamic programming in multiplicative lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2395595)