<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Progress in Mathematical Programming Solvers from 2001 to 2020 · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2206.09787/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2206.09787/feed.xml" rel="self" type="application/rss+xml" /><item><title>Progress in Mathematical Programming Solvers from 2001 to 2020 — mentioned by mattalex</title><link>https://news.ycombinator.com/item?id=41281640</link><guid isPermaLink="false">urn:hackerpapers:mention:2206.09787:41281640</guid><pubDate>Sun, 18 Aug 2024 11:15:57 GMT</pubDate><description>&lt;p&gt;The paper I have mentioned can be found here https://arxiv.org/pdf/2206.09787 There are so many things that have only been invented in the last couple of years like RINS, MCF cuts, conflict analysis, symmetry detection, dynamic search,... (see e.g. Tobias Achterberg&amp;#x27;s line of work). On the other hand, hardware improvements were not as relevant for LP and MILP solvers as one would expect: For instance, as of now there is still no solver that really uses GPU compute (though people are working on that). The reason is that parallelization of simplex solvers is quite though since the algorithm is…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2206.09787/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.OC</category></item><item><title>Progress in Mathematical Programming Solvers from 2001 to 2020 — mentioned by freemint</title><link>https://news.ycombinator.com/item?id=32287045</link><guid isPermaLink="false">urn:hackerpapers:mention:2206.09787:32287045</guid><pubDate>Sat, 30 Jul 2022 14:25:33 GMT</pubDate><description>&lt;p&gt;&amp;gt; we examine the contribution of more computing power to better outcomes No, they pick a set of problems where computational methods are known to have a beneficial impact and the plot every progress in that field against increased amounts of computing. Since amount of computing power used is monotonous and ELO score/Go performance/weather prediction success is trending monotonous the correlation is pretty high. However computation power is not the only thing that rose mostly monotonically during that time. At best they derived an upper bound of the contribution of more computing power to…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2206.09787/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.OC</category></item></channel></rss>
