In the bin packing problem, we are asked to pack a list of items

In the bin packing problem, we are asked to pack a list of items L to the minimum number of bins of capacity 1. Let M be the optimal number of bins required to pack a list L of items. Then next fit never uses more than 1.7M bins. ~@[](1)

答案：FALSE