[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[Help-glpk] mathprog example: pentomino puzzle
From: |
Andrew Makhorin |
Subject: |
[Help-glpk] mathprog example: pentomino puzzle |
Date: |
Sat, 07 May 2016 05:05:50 +0300 |
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
[Prev in Thread] |
Current Thread |
[Next in Thread] |
- [Help-glpk] mathprog example: pentomino puzzle,
Andrew Makhorin <=