A structured study series on Integer Linear Programming, from linear programming foundations to branch-and-bound, cutting planes, column generation, and decomposition methods.
These notes are based on my original Chinese study notes and have been carefully rewritten, expanded, and organized in English.
| No. | Title | Status |
|---|---|---|
| 01 | Simplex Method and Linear Programming Duality | Completed |
| 02 | Branch and Bound | Completed |
| 03 | Cutting Plane | Completed |
| 04 | Branch and Cut | Completed |
| 05 | Column Generation and Its Applications in Integer Linear Programming | Completed |
| 06 | Branch and Price | Completed |
| 07 | Lagrangian Relaxation and Duality | Completed |
| 08 | Dantzig-Wolfe Decomposition | Completed |
| 09 | Benders Decomposition | Completed |
| 10 | Computational Complexity Theory | Completed |
| 11 | Dynamic Programming | Completed |
| 12 | Knapsack Problem | Completed |
| 13 | Assignment Problem and Hungarian Algorithm | Completed |
| 14 | Convex Relaxation of Structured Binary Decisions via Mixed Norms | Completed |
| 15 | AI-Assisted ILP and MILP | Completed |
Beginning with the current version of this repository, original material created by Hang Li is licensed under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
Earlier versions released before the license change, including v1.0-cc-by-4.0, remain available under the Creative Commons Attribution 4.0 International License (CC BY 4.0).
Third-party materials, quotations, adapted figures, and referenced content are not covered by this license and remain subject to the rights of their respective copyright holders.
See the LICENSE file for details.