Skip to main content
Applied Mathematics and Computational Sciences
AMCS
Applied Mathematics and Computational Sciences
Study
Prospective Students
Current Students
Research
Research Areas
Research Groups
People
All People
Faculty
Affiliate Faculty
Instructional Faculty
Research Scientists
Research Staff
Postdoctoral Fellows
Administrative Staff
Alumni
Students
News
Events
SIAM Student Chapter
CEMSE Division
About
Apply
Dynamic programming
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining - 2022-10-04
Mikhail Moshkov, Professor, Applied Mathematics and Computational Sciences
Oct 4, 12:00
-
13:00
B9 L2 R2322
Dynamic programming
combinatorial optimization
data mining
Dynamic programming is an efficient technique to solve optimization problems. It is based on decomposing the initial problem into simpler ones and solving these sub-problems beginning from the simplest ones. A conventional dynamic programming algorithm returns an optimal object from a given set of objects.
