Definitions from Wiktionary (Lin-Kernighan heuristic)
▸ noun: (computing theory) In combinatorial optimization, a heuristic for solving the symmetric travelling salesman problem, involving the swapping of pairs of subtours to make a new tour.
▸ Words similar to lin-kernighan heuristic
▸ Usage examples for lin-kernighan heuristic
▸ Idioms related to lin-kernighan heuristic
▸ Wikipedia articles (New!)
▸ Words that often appear near lin-kernighan heuristic
▸ Rhymes of lin-kernighan heuristic
▸ Invented words related to lin-kernighan heuristic
▸ noun: (computing theory) In combinatorial optimization, a heuristic for solving the symmetric travelling salesman problem, involving the swapping of pairs of subtours to make a new tour.
Similar:
Kernighan-Lin algorithm,
traveling-salesman problem,
travelling salesman problem,
traveling salesman problem,
travelling-salesman problem,
basinhopping,
greedy algorithm,
Johnson's algorithm,
Chinese postman problem,
Kruskal's algorithm,
more...
▸ Words similar to lin-kernighan heuristic
▸ Usage examples for lin-kernighan heuristic
▸ Idioms related to lin-kernighan heuristic
▸ Wikipedia articles (New!)
▸ Words that often appear near lin-kernighan heuristic
▸ Rhymes of lin-kernighan heuristic
▸ Invented words related to lin-kernighan heuristic