Hi, I am trying to solve a problem where different items can be packed together (similar with the bin packing problem). The CLP takes to much time to solve the problem and I suspect is because of the fact that CLP investigates the same solution for several times. For example a packing (a, b, c) is equal (a, c, b) but is not equal with (b, a, c). I am wondering how can I formulate this into CLP and / or if there is some predefined library which can be used? Thanks, Bogdan.Received on Mon Apr 04 2011 - 10:20:42 CEST
This archive was generated by hypermail 2.2.0 : Thu Feb 02 2012 - 02:31:58 CET