Integrating Pareto optimization into dynamic programming

DOI10.3390/a9010012zbMath1461.90132OpenAlexW2253095596MaRDI QIDQ1736764

Cédric Saule, Robert Giegerich, Thomas Gatter

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a9010012

zbMATH Keywords

algebraic dynamic programmingPareto optimizationsorting algorithms

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Dynamic programming (90C39) Theory of programming languages (68N15) Theory of compilers and interpreters (68N20)

Related Items

Integrating Pareto optimization into dynamic programming ⋮ Dynamic programming bi-criteria combinatorial optimization

Uses Software

• Rfam
• RNAalifold
• Quicksort
• MODENA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multidimensional divide-and-conquer
• On a stable minimum storage merging algorithm
• Modeling dynamic programming problems over sequences and trees with inverse coupled rewrite systems
• Integrating Pareto optimization into dynamic programming
• A discipline of dynamic programming over sequence data
• Pareto optimal allocations and dynamic programming
• Implementing Quicksort programs
• Biological Sequence Analysis
• A Generalization of Dynamic Programming for Pareto Optimization in Dynamic Networks
• Sneaking around concatMap
• Round-Based Public Transit Routing
• On the adaptiveness of Quicksort