Knapsack problem

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

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by Christopher A Weiss Wed, 31 Jan 1996 20:39

#165

Author: 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

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads