Común · 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.
En Wikipedia
Texto en inglés Aún no hay artículo en tu idioma: extracto en 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: Wikipedia en inglés, CC BY-SA 4.0. ·
Cartas cercanas
-
★★★
Problema del viajante
-
★★
Ecuación de Bellman
-
★★★
Programación dinámica
Un método para reducir el tiempo de ejecución de un algoritmo mediante la utilización de subproblemas superpuestos y subestructuras óptimas, como se describe a continuación
-
★★
Problema del camino Hamiltoniano
-
P★★
Problema de transporte
-
T★★
TPK algorithm
Program to compare computer programming languages