. . . . "14052"^^ . . "45036001"^^ . . . . . . . "The Held\u2013Karp algorithm, also called Bellman\u2013Held\u2013Karp 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 . . . . . . . . . . . "The Held\u2013Karp algorithm, also called Bellman\u2013Held\u2013Karp 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 . . . . . "1110512615"^^ . . . . . . "Held\u2013Karp algorithm"@en . .