This project seeks to explore the famed knapsack problem in a 3D context using "parcels" shaped as pentominoes (shapes only one size unit larger than those of the famed tetrominoes from tetris) holding different values to maximise value while filling a theoretical cargo space with various algorithms.
-
Notifications
You must be signed in to change notification settings - Fork 0
This project seeks to explore the famed knapsack problem in a 3D context using "parcels" shaped as pentominoes (shapes only one size unit larger than those of the famed tetrominoes from tetris) holding different values to maximise value while filling a theoretical cargo space with various algorithms.
dominic-sagers/3D-Knapsack-Problem-With-Pentominos
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
This project seeks to explore the famed knapsack problem in a 3D context using "parcels" shaped as pentominoes (shapes only one size unit larger than those of the famed tetrominoes from tetris) holding different values to maximise value while filling a theoretical cargo space with various algorithms.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published