|
version 1.1, 2005/02/16 07:00:56
|
version 1.2, 2005/02/17 09:40:10
|
|
|
|
| | |
| | |
| I did a knapsack problem for CS331 at Cal Poly Pomona, fetching that now. | I did a knapsack problem for CS331 at Cal Poly Pomona, fetching that now. |
| |
|
| |
note superi means that in > sum of in-1 .. 1 |
| |
a noteable superset 64 32 16 8 4 2 1 |
| |
Branch and bound would try to add greatest weight first (actually doesn't it grab highest ratio first?) |
| |
need to include alternate handling for superincreasing, as it ends up being binary calculation (Although this does work too) |
| |
|
| |
We need to quit once we've found a solution that works, rather than wait for the most optimal (that doesnt exist, btw) |
| |
|
| |
for smbolism just switch backpack for palette and item for crate/box |
Return to
progress.txt
CVS log
Up to [RizwankCVS] / acm