The success of cutting planes depends on having fast re-optimization routines - if you spend too much time resolving the LP after adding it they become useless.
Nov 18, 2012 at 3:12 PM, Andrew Makhorin <[email protected]> wrote: > > The main bottleneck for GLPK MIP solver is GLPK LP solver, which is > > still slow compared to CLP, for instance. > > > > Success in solving mips mainly depends on cutting planes used, not on an > underlying lp solver. > > > -- ============================================================= Haroldo Gambini Santos Computing Department Universidade Federal de Ouro Preto - UFOP email: haroldo [at ] iceb.ufop.br home/research page: www.decom.ufop.br/haroldo
_______________________________________________ Help-glpk mailing list [email protected] https://lists.gnu.org/mailman/listinfo/help-glpk
