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 ★
Comum · Saberes
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.
Na Wikipédia
Texto em inglês Ainda não há artigo no seu idioma: trecho em inglês.
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.
Texto: Wikipédia em inglês, CC BY-SA 4.0. ·
Cartas próximas
-
Problema do caixeiro-viajante
Nº Q322212 ★★★
Sem ofertas
-
equação de Bellman
Necessary condition for optimality associated with dynamic programming
Nº Q1430750 ★★
Sem ofertas
-
Programação dinâmica
Um método para a construção de algoritmos para a resolução de problemas computacionais, em especial os de otimização combinatória
Nº Q380679 ★★★
Sem ofertas
-
Problema do caminho hamiltoniano
Nº Q987652 ★★
Sem ofertas
-
T
Transportation theory (mathematics)
The mathematical study of optimal transportation and allocation of resources
Nº Q1929885 ★★
Sem ofertas
-
A
Algoritmo de Trabb Pardo-Knuth
Nº Q7831057 ★★
Sem ofertas