A cutting stock problem

This is a report I wrote for B6.3 Integer Programming as part of my MSc in MMSC. It's on the binary cutting stock problem, a one-dimensional integer programming problem. I used an algorithm called branch-and-price, and implemented it (quite hurriedly) in Python. It is written in typst and compiled using their very incomplete HTML function, so there are quite a few rendering issues, but it should be mostly comprehensible. The report is here, and the code is here.