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

The Next Generation of Infrastructure
Delft University of Technology via edX The Beauty and Joy of Computing - AP® CS Principles Part 2
University of California, Berkeley via edX Advanced Data Structures in Java
University of California, San Diego via Coursera Theory of Computation
Indian Institute of Technology Kanpur via Swayam 离散数学
Shanghai Jiao Tong University via Coursera