Held–Karp algorithm
Solution of the traveling salesman problem
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. It finds the exact solution to this problem, and to several related problems including the Hamiltonian cycle problem, in exponential time.
Nº Q20203442 ★
Common · Knowledge
Held–Karp algorithm
Solution of the traveling salesman problem
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. It finds the exact solution to this problem, and to several related problems including the Hamiltonian cycle problem, in exponential time.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
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. It finds the exact solution to this problem, and to several related problems including the Hamiltonian cycle problem, in exponential time.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
Travelling salesman problem
NP-hard problem in combinatorial optimization
Nº Q322212 ★★★
Not listed
-
Bellman equation
Necessary condition for optimality associated with dynamic programming
Nº Q1430750 ★★
Not listed
-
Dynamic programming
Problem optimization method that simplifies a complicated problem by decomposing it into simpler subproblems recursively
Nº Q380679 ★★★
Not listed
-
Hamiltonian path problem
Computational problem in graph theory
Nº Q987652 ★★
Not listed
-
T
Transportation theory (mathematics)
The mathematical study of optimal transportation and allocation of resources
Nº Q1929885 ★★
Not listed
-
T
TPK algorithm
Program to compare computer programming languages
Nº Q7831057 ★★
Not listed