Search found 2 matches

by nickndn
Fri Jul 01, 2011 3:47 pm
Forum: Algorithms
Topic: Knapsack Problem - new algorithm
Replies: 1
Views: 3656

Re: Knapsack Problem - new algorithm

I. Integer item weight. Let's review how the DP algorithm works and focus on the important points. Let N be the item count, and M - the capacity of the knapsack. The DP algorithm constructs a table with dimensions M * N, and calculates for EVERY possible knapsack with capacity <= M all N possible so...
by nickndn
Wed Jun 29, 2011 10:04 am
Forum: Algorithms
Topic: Knapsack Problem - new algorithm
Replies: 1
Views: 3656

Knapsack Problem - new algorithm

Hello, i want to introduce you my algorithm for solving Knapsack Problem http://en.wikipedia.org/wiki/Knapsack_problem Can you tell me if i'm wrong, but i thing it is BETTER than DP algorithms Knapsack problem algorithm. Nikolay Nedelchev Bulgaria, Sofia e-mail : nickndn@gmail.com Let’s have a set o...

Go to advanced search