Combinatorial optimization implementation

Hi!

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?

Thanks,
José