Dynamic programming bi-criteria combinatorial optimization

DOI10.1016/J.DAM.2020.04.016zbMath1446.90139OpenAlexW3022211579MaRDI QIDQ777429

Michal Mankowski, Mikhail Ju. 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

zbMATH Keywords

dynamic programmingcircuit modelbi-criteria optimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (1)

Extensions of dynamic programming for multi-stage combinatorial optimization

Uses Software

• Algorithm 97

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Innovations in intelligent machines. 4. Recent advances in knowledge engineering
• Generalized dynamic programming for multicriteria optimization
• Geometric algorithms and combinatorial optimization
• Optimal binary search trees with costs depending on the access paths.
• Multicriteria optimization
• 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
• Fast multiplication of large numbers
• Optimum binary search trees
• Sequential Optimization of Matrix Chain Multiplication Relative to Different Cost Functions
• Computation of Matrix Chain Products. Part II
• Minimal Triangulations of Polygonal Domains
• Breaking paragraphs into lines
• Computation of Matrix Chain Products. Part I
• On Finding the Maxima of a Set of Vectors
• A Theorem on Boolean Matrices

This page was built for publication: Dynamic programming bi-criteria combinatorial optimization