mesut wrote:
This is a variant of the knapsack problem:
In particular, it's the multiple constrained knapsack problem. This one can
be solved using integer programming, for which there exist multiple
packages. It's not an easy problem to solve efficiently.
--
J.
I would like to know whether someone has a solution or in another word
a algoritm for this problem.
>
When you have a many packaging
let's say
pack A,
pack B,
Pack C,
Pack D
etc.. etc. etc.
>
You have pallets
Palet A
Palet B
Palet C
Palet D
etc. etc.
>
I would like to have a algoritm how many packaging can be on a palet?
A palet may contain several packaging types.
>
let's say:
Pallet A may contain 4 x Pack A - OR - contain 3 x Pack A and 2 x
PackB
>
a algoritm for this problem.
>
When you have a many packaging
let's say
pack A,
pack B,
Pack C,
Pack D
etc.. etc. etc.
>
You have pallets
Palet A
Palet B
Palet C
Palet D
etc. etc.
>
I would like to have a algoritm how many packaging can be on a palet?
A palet may contain several packaging types.
>
let's say:
Pallet A may contain 4 x Pack A - OR - contain 3 x Pack A and 2 x
PackB
>
In particular, it's the multiple constrained knapsack problem. This one can
be solved using integer programming, for which there exist multiple
packages. It's not an easy problem to solve efficiently.
--
J.
Comment