[Help-glpk] mathprog example: pentomino puzzle

[Andrew Makhorin]

Attached is a MathProg example to solve Pentomino puzzles (it will be
included in the next version of glpk).

This puzzle is modeled as the set partitioning problem. Interesting to
note that to solve the puzzle --minisat takes more time (about 6 secs)
than the glpk b&b solver (about 4 secs) though it is a feasibility
problem having a good CNF formulation.


Andrew Makhorin

pentomino.mod
Description: audio/mod