YoVDO

On the Solution of Pseudo-Polynomial Dynamic Programs Involving Large Magnitudes

Offered By: GERAD Research Center via YouTube

Tags

Dynamic programming Courses Complexity Theory Courses Recursion Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore an iterative algorithm for solving dynamic programs of pseudo-polynomial complexity in this GERAD Research Center DS4DM Coffee Talk. Delve into the intricacies of handling large magnitudes as Claudio Contardo from Concordia University presents a comprehensive approach. Learn about optimistic expanded networks, cycles, refinement techniques, and time windows. Discover label algorithms through practical examples, including a toy example to illustrate key concepts. Examine the impact of prepartitioning, multiplication, and complexity on the algorithm's performance. Gain insights into recursion examples and optimal solution strategies. Conclude with a thorough understanding of this innovative method for tackling challenging dynamic programming problems.

Syllabus

Intro
Optimistic Expanded Network
Cycles
Refinement
Example
Time windows
Label algorithms
An example
A toy example
Results
Prepartitioning
Multiplication
Complexity
Recursion example
Optimal solution
Conclusions


Taught by

GERAD Research Center

Related Courses

Algorithms: Design and Analysis, Part 2
Stanford University via Coursera Discrete Optimization
University of Melbourne via Coursera Conception et mise en œuvre d'algorithmes.
École Polytechnique via Coursera Computability, Complexity & Algorithms
Georgia Institute of Technology via Udacity Discrete Inference and Learning in Artificial Vision
École Centrale Paris via Coursera