who knows algorithm about stones and backpack?

Question

maybe somebody knows algorithm, or just what name it has, for putting stones (different weight) into different size backpacks? I should do it in Prolog. I give weights of stones and capacities of backpacks. Program should give me an answer how can I place all these stones into backpacks.

I think in general this is often called a "knapsack" (or "backpack" to some) problem. There are algorithms for it. I don't know a specific implementation in Prolog, but Googling for "knapsack problem" should get you moving in the right direction... — FrustratedWithFormsDesigner, Dec 10 '10 at 16:52
@FrustratedWithFormsDesigner: He has multiple knapsacks, so it's actually a bin-packing problem. — jason, Dec 10 '10 at 16:53

score 3 · Accepted Answer · answered Dec 10 '10 at 16:51

3

It's hard to tell since you haven't given much detail, but this sounds like a bin-packing problem. You can start on Wikipedia and Google to find algorithms that fit your needs (note that this an NP-Hard problem).

answered Dec 10 '10 at 16:51

jason

236,483
35
423
525

score 2 · Answer 2 · answered Dec 10 '10 at 16:51

2

It's called the knapsack problem.

answered Dec 10 '10 at 16:51

sascha

32,238
6
68
110

He has multiple knapsacks, so it's actually a bin-packing problem. – jason Dec 10 '10 at 16:53

score 1 · Answer 3 · answered Dec 10 '10 at 16:51

1

it's a classic problem, check knapsack problem

answered Dec 10 '10 at 16:51

matcheek

4,887
9
42
73

He has multiple knapsacks, so it's actually a bin-packing problem. – jason Dec 10 '10 at 16:52

who knows algorithm about stones and backpack?

3 Answers3