Sep 19, 2026 · Fundamentals

Dynamic Programming Mastery: 11 Classic Problems Solved with Recurrences & C Code

This article analyzes 11 classic dynamic programming problems including coin change, edit distance, LCS, LIS, maximum subarray, matrix chain multiplication, 0-1 knapsack, constrained shortest path, tiling with state compression, work allocation, and three-pass apple picking, providing recurrence relations, C implementations, and optimization techniques.

0-1 knapsackcoin changedynamic programming

0 likes · 34 min read

Dynamic Programming Mastery: 11 Classic Problems Solved with Recurrences & C Code

Model Perspective

Sep 16, 2024 · Operations

Can 0‑1 Knapsack Modeling Turn You Into a Time‑Management Master?

This article applies 0‑1 knapsack and multi‑objective optimization models to illustrate how students and professionals can allocate limited daily hours among competing tasks, using weighted importance and urgency to devise optimal schedules illustrated with real‑world case studies.

0-1 knapsackOptimizationmulti-objective

0 likes · 7 min read

Can 0‑1 Knapsack Modeling Turn You Into a Time‑Management Master?