Dynamic Programming

When the user wants to design and implement dynamic programming for combinatorial optimization — state-space design, Bellman recursions, memoization vs tabulation, solution recovery, and labeling algorithms for resource-constrained shortest paths. Also use when the user mentions "dynamic programming," "Bellman recursion," "state space," "Held-Karp," "labeling algorithm," "memoization," or when the problem decomposes into stages with overlapping subproblems. For pricing loops that call a DP oracle, see column-generation; for tree search driven by DP bounds, see branch-and-bound.

hajibabaie Updated 18 repo stars

File contents

hajibabaie/combinatorial-optimization-skills commit 84c7d72af0

Frequently asked questions

npx get-skill add hajibabaie/dynamic-programming