This repository contains the presentation materials for the Advanced Algorithms course taught by Dr. Malekimajd. It also includes a curated collection of slides, papers, and book chapters related to the Knapsack Problem, Dynamic Programming, Greedy Algorithms, and Branch and Bound.
| Category | Resource | Description | Download |
|---|---|---|---|
| University of Tehran Slides | Maktabkhooneh Course (Version 1) | Lecture 12 – Knapsack Problem Definition & Greedy Algorithm for the Fractional Knapsack Problem | 📄 12-Slides.pdf |
| Maktabkhooneh Course (Version 1) | Lecture 15 – Branch and Bound Algorithm for the Knapsack Problem | 📄 15-Slides.pdf | |
| Maktabkhooneh Course (Version 2) | Lecture 17 – Knapsack Problem, Greedy Algorithms for Fractional Knapsack, and Dynamic Programming for 0/1 Knapsack | 📄 AD-L17-Knapsack-Problem.pdf | |
| Maktabkhooneh Course (Version 2) | Lecture 21 – Branch and Bound Solution | 📄 AD-L21-Branch-and-Bound.pdf | |
| Research Paper | A Branch and Bound Algorithm for the Knapsack Problem (Kolesar, 1967) | Classic paper introducing the Branch and Bound approach for the Knapsack Problem. | 📄 kolesar1967.pdf |
| Book Chapter | Foundations of Algorithms (Neapolitan) | Chapter covering the Branch and Bound technique. | 📄 foundation-of-algorithm.pdf |
| Book Chapter | Grokking Algorithms (Aditya Bhargava) | Knapsack Problem and the Dynamic Programming solution for the 0/1 Knapsack Problem. | 📄 Grokking Algorithms.pdf |
- Greedy Algorithms
- Fractional Knapsack Problem
- 0/1 Knapsack Problem
- Dynamic Programming
- Branch and Bound
- Classic Research Paper
- Reference Book Chapters