Exploring a greedy solution to the stock cutting problem

Creating a quick estimation to the stock cutting solution

Contents

1. Motivation of the stock cutting problem
2. Quick overview of NP-Hard problems
3. Encoding the stock cutting problem into Python
4. The greedy algorithm
5. Comparison to exhaustive search in low n-space
6. Comparison to random search in higher n-space
7. Conclusion