Given a number of cuts/lengths of a given stock length, find the most efficent way to cut the stock with as little waste. This is also called bin packing and is also related to knapsack problem.
- bbp.py - my first fit bin packing
- csp-ortools.py - example from github
- ort-bin-pack.py - google example
- or-tools bin packing
- mpsolver
- first-fit pnb - first fit notebook on colab _ binpacking package