Re: multi-knapsack?

Hi Bjørnar,

You may find some ideas from the number partitioning problem:
https://en.wikipedia.org/wiki/Partition_problem
Regards,

*Sylvain Fournier*

On 26 May 2017 at 01:25, Andrew Makhorin <[email protected]> wrote:

> On Thu, 2017-05-25 at 13:54 +0200, Bjørnar Ness wrote:
> > Hello, glpk
> >
> > I have a problem which I believe could fit under the knapsack
> > umbrealla, but I am not sure,
> > and therefore ask here. The problem is as follows:
> >
> > *) I have a given number of containers
> > *) I have a number of items with different integer properties (weight,
> > volume, smell)
> > *) I want to equally distribute the item properties between the
> containers
> > *) subject to max for each property type/container
> > *) all items must be placed in containers
> >
> > What method should I look after for trying to define/solve this kind of
> problem?
>
> The method depends on the problem formulation used. You may formulate
> your problem as MIP, write it in the GNU MathProg modeling language and
> then use glpsol to solve it with B&B method.
>
> > An example would be nice.
> >
>
> See glpk/examples/bpp.mod .
>
>
>
> _______________________________________________
> Help-glpk mailing list
> [email protected]
> https://lists.gnu.org/mailman/listinfo/help-glpk
>

_______________________________________________
Help-glpk mailing list
[email protected]
https://lists.gnu.org/mailman/listinfo/help-glpk