GitHub - ndsvw/Box-Stacking-Problem: Dynamic-Programming solution of the "Box stacking"-Problem: Given a set of N rectangular 3-D boxes. What is the highest possible stack you can create with them? Only strictly smaller boxes
Dynamic Programming Implementation of Box Stacking Problem | PDF | Integer (Computer Science) | Applied Mathematics
![Planning problem: (a) box-collecting world; (b) box-stacking sample;... | Download Scientific Diagram Planning problem: (a) box-collecting world; (b) box-stacking sample;... | Download Scientific Diagram](https://www.researchgate.net/publication/235800950/figure/fig11/AS:299794653302785@1448488023061/Planning-problem-a-box-collecting-world-b-box-stacking-sample-c-partial-BN-for.png)