Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Lin–Kernighan_heuristic> ?p ?o. }
Showing items 1 to 15 of
15
with 100 items per page.
- Lin–Kernighan_heuristic abstract "This article is about the heuristic for the travelling salesman problem. For a heuristic algorithm for the graph partitioning problem, see Kernighan–Lin algorithm.In combinatorial optimization, Lin–Kernighan is one of the best heuristics for solving the Euclidean travelling salesman problem. Briefly, it involves swapping pairs of sub-tours to make a new tour. It is a generalization of 2-opt and 3-opt. 2-opt and 3-opt work by switching two or three paths to make the tour shorter. Lin–Kernighan is adaptive and at each step decides how many paths between cities need to be switched to find a shorter tour.".
- Lin–Kernighan_heuristic wikiPageID "8818888".
- Lin–Kernighan_heuristic wikiPageRevisionID "575676776".
- Lin–Kernighan_heuristic subject Category:Combinatorial_algorithms.
- Lin–Kernighan_heuristic subject Category:Combinatorial_optimization.
- Lin–Kernighan_heuristic subject Category:Heuristic_algorithms.
- Lin–Kernighan_heuristic subject Category:Travelling_salesman_problem.
- Lin–Kernighan_heuristic comment "This article is about the heuristic for the travelling salesman problem. For a heuristic algorithm for the graph partitioning problem, see Kernighan–Lin algorithm.In combinatorial optimization, Lin–Kernighan is one of the best heuristics for solving the Euclidean travelling salesman problem. Briefly, it involves swapping pairs of sub-tours to make a new tour. It is a generalization of 2-opt and 3-opt. 2-opt and 3-opt work by switching two or three paths to make the tour shorter.".
- Lin–Kernighan_heuristic label "Algorithme de Lin-Kernighan".
- Lin–Kernighan_heuristic label "Lin–Kernighan heuristic".
- Lin–Kernighan_heuristic sameAs Lin%E2%80%93Kernighan_heuristic.
- Lin–Kernighan_heuristic sameAs Algorithme_de_Lin-Kernighan.
- Lin–Kernighan_heuristic sameAs Q2835802.
- Lin–Kernighan_heuristic sameAs Q2835802.
- Lin–Kernighan_heuristic wasDerivedFrom Lin–Kernighan_heuristic?oldid=575676776.