Integrating Pareto optimization into dynamic programming

DOI10.3390/A9010012MaRDI QIDQ1736764zbMATH OpenOpenAlexFDO

Authors Thomas Gatter, Robert Giegerich, Cédric Saule

Publication date 26 March 2019

Published in Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

algebraic dynamic programmingPareto optimizationsorting algorithms

Mathematics Subject Classification ID

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

Recommendations

• Dynamic programming with Pareto sets
• Pareto optimal allocations and dynamic programming
• Dynamic programming multi-objective combinatorial optimization
• scientific article; zbMATH DE number 6003201
• A Generalization of Dynamic Programming for Pareto Optimization in Dynamic Networks
• Pareto optimization for subset selection with dynamic cost constraints
• scientific article; zbMATH DE number 1380436
• Dynamic programming and the Lagrange multipliers
• Pareto optima of multicriteria integer linear programs
• scientific article; zbMATH DE number 6160040

Cites work

• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 1848402 (Why is no real title available?)
• A Generalization of Dynamic Programming for Pareto Optimization in Dynamic Networks
• A discipline of dynamic programming over sequence data
• Biological Sequence Analysis
• Implementing Quicksort programs
• Integrating Pareto optimization into dynamic programming
• Introduction to algorithms
• Modeling dynamic programming problems over sequences and trees with inverse coupled rewrite systems
• Multidimensional divide-and-conquer
• On a stable minimum storage merging algorithm
• On the adaptiveness of Quicksort
• Pareto optimal allocations and dynamic programming
• Round-Based Public Transit Routing
• Sneaking around concatmap, efficient combinators for dynamic programming

Cited in

(5)

• Dynamic programming with Pareto sets
• Pareto optimal allocations and dynamic programming
• Dynamic programming bi-criteria combinatorial optimization
• The dynamic optimization of PKM
• Integrating Pareto optimization into dynamic programming

Describes a project that uses

Uses Software

• MODENA
• Quicksort
• RNAalifold
• Rfam

This page was built for publication: Integrating Pareto optimization into dynamic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736764)