Skip to search formSkip to main contentSkip to account menu

Dynamic programming

Known as: Dynamic optimization, Dynamic programming/Implementations and Examples, DP 
In mathematics, management science, economics, computer science, and bioinformatics, dynamic programming (also known as dynamic optimization) is a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Algorithm designAnytime algorithmBLATBackpropagation

Broader (2)

Mathematical optimizationSystems engineering

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Jena Research Papers in Business and Economics Optimally Routing and Scheduling Tow Trains for JIT-Supply of Mixed-Model Assembly Lines
In recent years, more and more automobile producers adopted the supermarketconcept to enable a exible and reliable Just-in-Time… 
Highly Cited
2003
Highly Cited
2003
The Cost of Labor Adjustment: Inferences from the Gap
We study labor adjustment costs. We specify a dynamic optimization problem at the plant-level, allowing for both convex and non… 
Highly Cited
2002
Highly Cited
2002
Secure distributed constraint satisfaction: reaching agreement without revealing private information
Highly Cited
1999
Highly Cited
1999
AUTOMATIC ROAD EXTRACTION BASED ON MULTI-SCALE, GROUPING, AND CONTEXT
An approach for the automatic extraction of roads from digital aerial imagery is proposed. It makes use of several versions of… 
Highly Cited
1996
Highly Cited
1996
Constrained Discounted Dynamic Programming
This paper deals with constrained optimization of Markov Decision Processes with a countable state space, compact action sets… 
Highly Cited
1994
Highly Cited
1994
A One Pass Decoder Design For Large Vocabulary Recognition
To achieve reasonable accuracy in large vocabulary speech recognition systems, it is important to use detailed acoustic models… 
Highly Cited
1993
Highly Cited
1993
Computational solution of dynamic optimization problems with general differential-algebraic constraints
Highly Cited
1990
Highly Cited
1990
The rendezvous problem on discrete locations
Two friends have become separated in a building or shopping mall and and wish to meet as quickly as possible. There are n… 
Highly Cited
1986
Highly Cited
1986
A Design Methodology for Synthesizing Parallel Algorithms and Architectures
Highly Cited
1977
Highly Cited
1977
Operations Research: Principles and Practice.
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)