Knapsack problem

Article View: comp.lang.c++.leda

Article #165

Back to comp.lang.c++.leda Previous Next

#165

From: Christopher A Weiss
Date: Wed, 31 Jan 1996 20:39

14 lines
888 bytes

Greetings.

I am looking for c++ or ansi C code for a solution to the knapsack
problem or the sum-of-subsets problem (Knapsack problem with the
definition of finding the exact number, not the closest number) to
compare to my algorithm for speed comparisons.  If anyone either has
code or knows where to find it, please email me at wiseman@cs.unlv.edu

Note: I am looking for the most efficent code possible to see how it
compares to mine.  Thanks!

--
"Omni Ignotum Pro Magnifico" - 
Everything Unknown Passes for Something Splendid

Technical Details

Message-ID: <4eok1j$4js@homesick.cs.unlv.edu>

Path: arc1-ca.pugleaf.net!homesick.cs.unlv.edu!wiseman

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!homesick.cs.unlv.edu!wiseman
From: wiseman@unlv.edu (Christopher A Weiss)
Newsgroups: comp.lang.c++.leda
Subject: Knapsack problem
Date: 31 Jan 1996 20:39:15 GMT
Organization: UNLV College of Engineering
Message-ID: <4eok1j$4js@homesick.cs.unlv.edu>
NNTP-Posting-Host: lil-ed.cs.unlv.edu
X-Newsreader: TIN [version 1.2 PL2]