Dynamic programming multi-objective combinatorial optimization
From MaRDI portal
Publication:2218697
Recommendations
- Dynamic programming bi-criteria combinatorial optimization
- On a biobjective search problem in a line: formulations and algorithms
- Extensions of dynamic programming for multi-stage combinatorial optimization
- Dynamic programming for a biobjective search problem in a line
- scientific article; zbMATH DE number 43711
- Bucket elimination for multiobjective optimization problems
- Polyhedral Characterization of Discrete Dynamic Programming
- The principle of optimality in the design of efficient algorithms
- scientific article; zbMATH DE number 863497
Cited in
(10)- Time dependency in multiple objective dynamic programming
- Dynamic programming bi-criteria combinatorial optimization
- Optimization of dynamic programming methods when solving extremal combinatorial problems
- scientific article; zbMATH DE number 6003201 (Why is no real title available?)
- Integrating Pareto optimization into dynamic programming
- Combinatorial data analysis. Optimization by dynamic programming
- Dynamic programming for a biobjective search problem in a line
- Dynamic programming and the Lagrange multipliers
- Generalized dynamic programming for multicriteria optimization
- Extensions of dynamic programming for multi-stage combinatorial optimization
This page was built for publication: Dynamic programming multi-objective combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2218697)