I’ll try to test it on my OS X platform later. I have a question: suppose the same problem can be formulated as both a SAT or a 0-1 integer program. Which can be solved faster in general?
> On May 24, 2017, at 4:25 AM, Andrew Makhorin <[email protected]> wrote: > > glpsol --minisat -m pbn.mod -d disney.dat
_______________________________________________ Help-glpk mailing list [email protected] https://lists.gnu.org/mailman/listinfo/help-glpk
