Dynamic programming bi-criteria combinatorial optimization
From MaRDI portal
Publication:777429
DOI10.1016/J.DAM.2020.04.016zbMATH Open1446.90139OpenAlexW3022211579MaRDI QIDQ777429FDOQ777429
Michal Mankowski, Mikhail Moshkov
Publication date: 7 July 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.04.016
Recommendations
- Extensions of dynamic programming for multi-stage combinatorial optimization
- Dynamic programming multi-objective combinatorial optimization
- Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization
- Dynamic programming for a biobjective search problem in a line
- scientific article; zbMATH DE number 1157223
Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Dynamic programming (90C39)
Cites Work
- A note on two problems in connexion with graphs
- Introduction to algorithms
- Geometric algorithms and combinatorial optimization
- Multicriteria optimization
- A Theorem on Boolean Matrices
- Fast multiplication of large numbers
- Generalized dynamic programming for multicriteria optimization
- On Finding the Maxima of a Set of Vectors
- Title not available (Why is that?)
- Innovations in intelligent machines. 4. Recent advances in knowledge engineering
- Optimum binary search trees
- Minimal Triangulations of Polygonal Domains
- Optimal binary search trees with costs depending on the access paths.
- Integrating Pareto optimization into dynamic programming
- Reference points and approximation algorithms in multicriteria discrete optimization
- Bi-criteria optimization of decision trees with applications to data analysis
- Sequential Optimization of Matrix Chain Multiplication Relative to Different Cost Functions
- Computation of Matrix Chain Products. Part II
- Breaking paragraphs into lines
- Computation of Matrix Chain Products. Part I
Cited In (6)
- Bi-criteria optimization problems for decision rules
- Extensions of dynamic programming for multi-stage combinatorial optimization
- Bicriteria product design optimization: An efficient solution procedure using AND/OR trees
- Optimization of dynamic programming methods when solving extremal combinatorial problems
- Dynamic programming multi-objective combinatorial optimization
- Title not available (Why is that?)
Uses Software
This page was built for publication: Dynamic programming bi-criteria combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q777429)
