Facts
Urlhttps://en.wikipedia.org/wiki/Held%E2%80%93Karp_algorithm
Sources
Wikipedia: Held-Karp algorithm
Lead sectionQuote, Lead section
The Held-Karp algorithm, also called the Bellman-Held-Karp algorithm, is a dynamic programming algorithm proposed in 1962 independently by Bellman and by Held and Karp to solve the traveling salesman problem (TSP), in which the input is a distance matrix between a set of cities, and the goal is to find a minimum-length tour that visits each city exactly once before returning to the starting point.
Claims Backed By This Source (8 claims)
This source backs 8 claims across the atlas. As facts: 2 well-attested. As cited relationships: 4 holds. Plus 2 entities citing it as a general reference with no single fact or relationship attached.
Disposition By Topic
- Algorithms, 7 claims: 1 well-attested, 4 holds, 2 general references.
- Sources, 1 claims: 1 well-attested.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.