Knapsack Problem

[querent]

Hi all,

So I'm a python user (not much else), and I have need of heuristic approaches to the Knapsack Problem. It's the 0-1 bounded knapsack problem.

I know I've got wikipedia, but would appreciate any pointers. (I'm out of university for now, so I need online free stuff.)

Thanks and Godspeed,
q

[crmccreary]

One implementation: http://www.ics.uci.edu/~eppstein/161/python/knapsack.py