![]() |
|
![]() |
|
|
Thread Tools | Display Modes |
|
|
#1 |
|
Newbie
Join Date: Jan 2006
Posts: 27
Rep Power: 0
![]() |
How to use Knapsack problem?
Basically I have a set, O consisting of N 3-tuples, <X, Y, Z>. I am trying to construct a set O' subject to the constraint that sum of all X's in O' is within some range X'Range, the average of all Y's is within some range Y'Range, and the sum of all Z's is within some range Z'Range.
This seems like a perfect situation for the knapsack problem does it not? However I am a little confused about how to do this. Pseudocode would be great! Steve |
|
|
|
![]() |
| Bookmarks |
| Currently Active Users Viewing This Thread: 1 (0 members and 1 guests) | |
| Thread Tools | |
| Display Modes | |
|
|
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Has anybody done a knapsack problem in VB-- I'd like your script! | scm007 | Visual Basic .NET | 3 | Nov 4th, 2006 2:06 AM |
| Anybody have a workig multidimensional knapsack problem I could look at? | scm007 | Software Design and Algorithms | 5 | Nov 3rd, 2006 12:57 PM |
| Stuck with a C problem | Polaris | C++ | 8 | Aug 19th, 2006 3:30 PM |
| cgi/perl script + IE problem | joyceshee | Perl | 2 | Jan 24th, 2006 11:10 AM |