Topic summary
Bin packing
Extracted from the Wikipedia article Bin packing problem.
Hardness of bin packing
The bin packing problem is strongly NP-complete. This can be proven by reducing the strongly NP-complete 3-partition problem to bin packing.
Topic summary
Extracted from the Wikipedia article Bin packing problem.
The bin packing problem is strongly NP-complete. This can be proven by reducing the strongly NP-complete 3-partition problem to bin packing.