|
From: | Meketon, Marc |
Subject: | Re: [Help-glpk] MIP Solvers (i.e CBC, CPLEX, GLPK, GUROBI, LPSOLVE, SCIPC, SCIPL, SCIPS and XPRESS) Benchmark |
Date: | Sun, 18 Nov 2012 10:30:55 -0600 |
Note that in a post 16-June-2012 (http://lists.gnu.org/archive/html/help-glpk/2012-06/msg00023.html)
, Andrew Makhorin said in response to his plans for “history branching”: “I plan to implement a strong branching first. However, this requires reimplementing the basis factorization module in a more efficient way.” Hopefully, improving the efficiency of the main computational step of the simplex implementation is still on Andrew’s list. From: help-glpk-bounces+address@hidden [mailto:help-glpk-bounces+address@hidden
On Behalf Of Haroldo Santos The main bottleneck for GLPK MIP solver is GLPK LP solver, which is still slow compared to CLP, for instance. On Sun, Nov 18, 2012 at 12:13 PM, Nigel Galloway <address@hidden> wrote:
LPSOLVE can read and solve mathprog.
--
This e-mail and any attachments may be confidential or legally privileged. If you received this message in error or are not the intended recipient, you should destroy the e-mail message and any attachments or copies, and you are prohibited from retaining, distributing, disclosing or using any information contained herein. Please inform us of the erroneous delivery by return e-mail. Thank you for your cooperation. |
[Prev in Thread] | Current Thread | [Next in Thread] |