ISBN: | 978-5-5142-1906-3 |
High Quality Content by WIKIPEDIA articles! In computational complexity theory, the bin packing problem is a combinatorial NP-hard problem. In it, objects of different volumes must be packed into a finite number of bins of capacity V in a way that minimizes the number of bins used.