geoff@desint.UUCP (Geoff Kuenning) (03/03/86)
Does anybody have a knapsack-filling algorithm that does the whole problem:
each item has a weight and a utility, and the idea is to maximize the utility
while satisfying a weight constraint?
I have a knapsack filler for the case where all utilities are equal,
and I have enough sample Traveling Salesman algorithms that I am sure I can
produce the code myself if I have to, but it sure would be nice to get
it from somewhere else.
--
Geoff Kuenning
{hplabs,ihnp4}!trwrb!desint!geoff