Re: [Help-glpk] order restrictions

[robin hankin]

If your instance is pure 0-1 and all constraint coefficients are
integer, you may try to solve it with the minisat solver supported by
glpsol. You need to specify the '--minisat' option, in which case glpsol
transforms your instance to a satisfiability problem and solves the
latter with minisat. For more details please see the glpk reference
manual. See also an example model (the "paint-by-numbers" puzzle) in the
subdirectory glpk/examples/pbn.

Heh.  Using 'glpsol  --minisat'   gave the answer almost instantaneously [it took ~15 hours without the --minisat option].

Could this option be mentioned in the examples/read.me file please?

:-)

Robin


-- 
Robin Hankin
Uncertainty Analyst
address@hidden