| Home |
| Search |
| Today's Posts |
|
#5
Posted to microsoft.public.excel.programming
|
|||
|
|||
The Mt. Everest of requests
Thank you Martin
Dynamic programming solution Unbounded knapsack problem If all weights (w1,...,Wn,W) are nonnegative integers, the knapsack problem can be solved in pseudo-polynomial time using dynamic programming. The following describes a dynamic programming solution for the unbounded knapsack problem. The Knapsack/Rucksack problem is exactly what I am looking for, and I suppose my next biggest problem is to find an equivelant VB formula to make it come to life... Appreciate the pointer Mick |
| Thread Tools | Search this Thread |
| Display Modes | |
|
|
Similar Threads
|
||||
| Thread | Forum | |||
| 2 nice requests | Excel Programming | |||
| Excel requests the installation disc on startup !! why ? | Excel Discussion (Misc queries) | |||
| Exceeding Cell Limit with HTTP requests | Excel Discussion (Misc queries) | |||
| Excel suddenly requests the instal disk! | Excel Discussion (Misc queries) | |||
| template for check requests | Excel Worksheet Functions | |||
Threaded Mode
