[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: Solver performance solving examples/life_goe.mod

From: Andrew Makhorin
Subject: Re: Solver performance solving examples/life_goe.mod
Date: Sat, 26 Sep 2020 15:15:27 +0300

On Sat, 2020-09-26 at 13:54 +0200, Domingo Alvarez Duarte wrote:
> Hello !
> Testing GLPK I left it solving examples/lie_goe.mod for more than 2 
> hours and it didn't found a solution (wasm and native) then I stopped 
> then and tried with cplex/gurobi/xpress/scip all of then gives a 
> solution instantly (except scip that takes 3s).
> The difference is so big, have someone managed through command line 
> options or other means managed to get a solution quickly with glpsol ?
> Any idea of how to improve GLPK to not be so behind ?

Hire 100 top-class specialists in integer programming and combinatorial
optimization, and give them 10 (or better 20) years. )))

If seriously, I think that gurobi (as well as cplex) solves many
combinatorial instances with hybrid methods other than pure branch-and-
cut. For example, glpk/examples/pbn.mod is very hard for b&c, but can be
relatively easily solved with a SAT solver.

> Cheers !

reply via email to

[Prev in Thread] Current Thread [Next in Thread]