Dynamic programming multi-objective combinatorial optimization
DOI10.1007/978-3-030-63920-4zbMATH Open1483.90006OpenAlexW3093418146MaRDI QIDQ2218697FDOQ2218697
Authors: Michal Mankowski, Mikhail Moshkov 
Publication date: 18 January 2021
Published in: Studies in Systems, Decision and Control (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10754/665627
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
- 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
Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Dynamic programming (90C39) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Cited In (8)
- Time dependency in multiple objective dynamic programming
- Generalized dynamic programming for multicriteria optimization
- Title not available (Why is that?)
- Combinatorial data analysis. Optimization by dynamic programming
- Optimization of dynamic programming methods when solving extremal combinatorial problems
- Dynamic programming and the Lagrange multipliers
- Integrating Pareto optimization into dynamic programming
- Dynamic programming for a biobjective search problem in a line
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)
