Is it NP-hard to fill up bins with minimum moves? please if you do not know the answer or if you are not an ambitious than do not send the answer or i will report it.
Answers
Answered by
1
Answer:
Bin packing problem. 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.
Hope you got the answer.
please mark me the brainliest.
have a good day.
Similar questions