Re: A Bin Packing like problem

What you are trying to solve is closer to Subset-Sum problem. In fact
it could be exactly Max-Subset-Sum Problem.

Subset set problem (given a single dimension matrix V(n) of integer,
and a sum value T, find an vector X(n) where X(i) = {0,1}, Sum(V x X)
= T, where V x X is the matrix product) is NP hard. (google on subset
set problem and you can find better description than what I wrote!!)


Max subset set problem, as defined for you problem could be:

Find X(n) s.t. (constraint) V x X <= T, and (optimization function)
maximize (V x X).

You can find literature on approximation algorithms to find a solution
for max-subset sum problem.

-HIH
Amit Gupta

.