In the bin packing problem, items of different volumes must be packed into a finite number of bins or containers each of a fixed given volume in a way that minimizes the number of bins used. In computational complexity theory, it is a combinatorial NP-hard problem. The decision problem (deciding if items will fit into a specified number of bins) is NP-complete.
-
Notifications
You must be signed in to change notification settings - Fork 0
dishijn2/The-Bin-packing-Problem
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
Project based on Data Structures and Algorithms
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published