José Roberto Pereira · Oct 2, 2020

Combinatorial optimization implementation


I need to solve a combinatorial optimization problem, like the Knapsack Problem.

I found some implementations, but they're memory inneficient. I also found libraries like this one from Google.

However, first I'd like to ask you guys for your experiences doing this kind of task in Caché/IRIS platform. Do you guys have implemented your own code or used a third party library?


0 160
Discussion (1)2
Log in or sign up to continue

Hi José,

I think it's better to implements your own code... and more in this case, where you can "convert" arrays to globals or process-private globals and to solve any problem without worry about number of items...