Re: [Fwd: GLPK was used in the proof of the 300 year old Kepler conjecture]
Chris Matrakidis <[email protected]>
| Newsgroups | gmane.comp.gnu.glpk |
|---|---|
| Message-ID | <CAEaJ3S5pgegW+Gu2M7WKYFyv6xTZ9bqzy0uwMs3fnuD6OKXtug@mail.gmail.com> |
> Really nice !!! GLPK page should include a section "Successful > applications". > Here is another one I found recently, although not so impressive: Weibin Dai, Jun Zhang and Xiaoqian Sun, "On solving Multi-Commodity Flow Problems: An experimental evaluation," Chinese Journal of Aeronautics, preprint: http://m3nets.de/publications/CJA2017b.pdf From the conclusion: "Separately, for column generation, GLPK has the best properties, but CVXPY can outperform GLPK while solving MCFP with a large number of commodities. For Lagrangian relaxation, it is shown that using Dijkstra shortest-path method to solve the Lagrangian sub-problem is the best choice. In general, GUROBI performs a medium level in both algorithms and SCIPY is always the worst one." Best Regards, Chris Matrakidis _______________________________________________ Help-glpk mailing list [email protected] https://lists.gnu.org/mailman/listinfo/help-glpk