Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Held–Karp_algorithm> ?p ?o }
Showing triples 1 to 32 of
32
with 100 triples per page.
- Held–Karp_algorithm abstract "The Held–Karp algorithm, also called 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). TSP is an extension of the Hamiltonian circuit problem. The problem can be described as: find a tour of N cities in a country (assuming all cities to be visited are reachable), the tour should (a) visit every city just once, (b) return to the starting point and (c) be of minimum distance.Broadly, the TSP is classified as symmetric travelling salesman problem (sTSP), asymmetric travelling salesman problem (aTSP), and multi-travelling salesman problem (mTSP).The mTSP is generally treated as a relaxed vehicle routing problem.".
- Held–Karp_algorithm wikiPageID "45036001".
- Held–Karp_algorithm wikiPageLength "9901".
- Held–Karp_algorithm wikiPageOutDegree "13".
- Held–Karp_algorithm wikiPageRevisionID "695420306".
- Held–Karp_algorithm wikiPageWikiLink Category:Dynamic_programming.
- Held–Karp_algorithm wikiPageWikiLink Christofides_algorithm.
- Held–Karp_algorithm wikiPageWikiLink Dynamic_programming.
- Held–Karp_algorithm wikiPageWikiLink Hamiltonian_path_problem.
- Held–Karp_algorithm wikiPageWikiLink Integer_programming.
- Held–Karp_algorithm wikiPageWikiLink Linear_programming.
- Held–Karp_algorithm wikiPageWikiLink Nearest_neighbour_algorithm.
- Held–Karp_algorithm wikiPageWikiLink Permutation.
- Held–Karp_algorithm wikiPageWikiLink Richard_E._Bellman.
- Held–Karp_algorithm wikiPageWikiLink Richard_M._Karp.
- Held–Karp_algorithm wikiPageWikiLink Stirlings_approximation.
- Held–Karp_algorithm wikiPageWikiLink Travelling_salesman_problem.
- Held–Karp_algorithm wikiPageWikiLink Vehicle_routing_problem.
- Held–Karp_algorithm wikiPageWikiLinkText "Held–Karp algorithm".
- Held–Karp_algorithm wikiPageWikiLinkText "Held–Karp algorithm".
- Held–Karp_algorithm wikiPageUsesTemplate Template:Reflist.
- Held–Karp_algorithm subject Category:Dynamic_programming.
- Held–Karp_algorithm hypernym Algorithm.
- Held–Karp_algorithm type Software.
- Held–Karp_algorithm comment "The Held–Karp algorithm, also called 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). TSP is an extension of the Hamiltonian circuit problem.".
- Held–Karp_algorithm label "Held–Karp algorithm".
- Held–Karp_algorithm sameAs Q20203442.
- Held–Karp_algorithm sameAs الگوریتم_Held-Karp.
- Held–Karp_algorithm sameAs m.012n8mww.
- Held–Karp_algorithm sameAs Q20203442.
- Held–Karp_algorithm wasDerivedFrom Held–Karp_algorithm?oldid=695420306.
- Held–Karp_algorithm isPrimaryTopicOf Held–Karp_algorithm.