<instructions>Your goal is to analyze the following comment and estimate how highly it will be upvoted by the Hacker News community.</instructions><comment><author>ngruhn</author><text>These solvers really show that NP-hardness is no reason to give up. For example, they can solve surprisingly large Traveling Salesmen instances to proven optimality.</text><parent_chain></parent_chain></comment><story><title>Solver Performance: 1989 vs. 2024</title><url>https://www.solvermax.com/blog/solver-performance-1989-vs-2024</url></story>
<instructions>Your goal is to analyze the following comment and estimate how highly it will be upvoted by the Hacker News community.</instructions><comment><author>Epa095</author><text>A bit disappointed that there were no reimplementation and real benchmarking happening.</text><parent_chain></parent_chain></comment><story><title>Solver Performance: 1989 vs. 2024</title><url>https://www.solvermax.com/blog/solver-performance-1989-vs-2024</url></story>