Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/12/84; site desint.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!gamma!epsilon!zeta!sabre!petrus!bellcore!decvax!ittatc!dcdwest!sdcsvax!sdcrdcf!trwrb!desint!geoff
From: geoff@desint.UUCP (Geoff Kuenning)
Newsgroups: net.wanted.sources
Subject: knapsack algorithm needed
Message-ID: <162@desint.UUCP>
Date: Mon, 3-Mar-86 03:14:11 EST
Article-I.D.: desint.162
Posted: Mon Mar  3 03:14:11 1986
Date-Received: Wed, 5-Mar-86 06:48:30 EST
Reply-To: geoff@desint.UUCP (Geoff Kuenning)
Organization: SAH Consulting, Manhattan Beach, CA
Lines: 12

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