Re:A CP Solution for XKCD NP Complete Restaurant Order
by mistermcgruff on Tuesday May 28, 2013 @01:45PM
(#5781393)
It's not a constraint programming solver, but rather a linear programming solver. The algorithm the comment above used is "branch and bound" on top of the Simplex method to handle the integer constraints.
Tutorial here: http://analyticsmadeskeezy.com/2012/08/29/optimal-blending-o...
Wikipedia here:
http://en.wikipedia.org/wiki/Linear_programming
http://en.wikipedia.org/wiki/Simplex_algorithm
http://en.wikipedia.org/wiki/Branch_and_bound
[ Parent
| on HN ]
There are no comments on this comment yet.