Traveling Salesman Problem
HoldTechniques
A classic optimization problem of visiting each city once with minimal total travel.
Why it's here
Placed in Hold: 2 article(s) of evidence from 1 source(s), led by research-stage coverage, with 0 in the last 30 days. Confidence 31%.
Evidence (2)
- 4Hacker News·8/13/2026researchPostmortem on NP-hard pessimism
The article argues that NP-hardness is often overstated in practice, because many real-world workloads never hit the worst case and can still be solved efficiently with good algorithms and heuristics. It cites examples such as package dependency resolution, type checking, scheduling, TSP, and SAT/SMT solving at scale to show that theory does not always predict practical performance.
- 4Hacker News·8/4/2026researchWhy Some People Mow a Lawn Better Than Others
The article describes an experiment in which over 30,000 people solved a lawn-mowing route-planning task, with many reaching near-optimal paths and 16% achieving perfect solutions. It uses the results to illustrate coverage path planning and the way humans rely on heuristics for combinatorial problems that become hard for computers as they scale.