Re:A CP Solution for XKCD NP Complete Restaurant Order
by hartror on Wednesday May 29, 2013 @03:26AM
(#5785108)
I have tested out using gecode as a minizinc backend as I like the look of gint. I've been skimming hakank.org but it is a little advance for me at the moment.
Is there a way to get a minizinc model into cp optimizer?
Re:A CP Solution for XKCD NP Complete Restaurant Order
by mzl on Wednesday May 29, 2013 @04:35AM
(#5785263)
I have no idea if it is possible to use Minizinc models with CP Optimizer, but I would guess not. It doesn't feel like a feature that would be of business interest to IBM to develop.
As for Håkans pages, http://www.hakank.org/common_cp_models/#xkcd has a list of 21 implementations of the xkcd problem.
Also, since you seem to be interested in using Minizinc for modelling, you can use other back-ends than the built in one for solving models.
For some more code examples, see also Håkan Kjellerstrands blog (http://www.hakank.org/constraint_programming_blog/) which, among other things, contains numerous solutions to the xkcd problem suing different systems.