Interesting Optimization Problem

[abhishekm71]

Hi!

In an application, I have come across the following interesting problem.

There are 'n' integers x₁, x₂, x₃, ... x_n. (0 < n <= 60) and (200 <= x_i <= 1800)

We have to arrange them in 'm' groups so that in each group, the sum of x's <= 1800.

Problem is to minimize 'm' (the number of groups that we have to form).

I shall be grateful if I can get any ideas on it. Time Complexity is not much
constraint so long as it remains within reasonable limits (the user doesn't have to wait too long for the answer).

Thanks

[JLBorges]

Google for "one-dimensional bin packing problem"

[abhishekm71]

ok will do so, thanks jlborges