2/11/2015 10:54 AM | |
Joined: 9/8/2009 Last visit: 7/17/2023 Posts: 1410 Rating: (152) |
I need a special sorting algorithm, known as algorithm that solves unbounded knapsack problem. The proposed algorithm I choose is Martello-Toth MTU2: http://www.or.deis.unibo.it/staff_pages/martello/cvitae.html The author wrote this algorithm in FORTRAN, now first I have to translate this in SCL. But what execution times I can expect? The author tested the algorithm on HP9000/850: HP 9000/850 Cheetah (also HP 9000/850S):
Now what would be a good candidate of S7 CPU with SCL to compute the result maximaly 10 times slower? Any good advice how to solve unbounded knapsack problem with S7, for small dataset (n=20)? |
Follow us on