Variable neighborhood search for extremal graphs. 5. Three ways to automate finding conjectures.

Gilles Caporossi Pierre Hansen

Published in: Discret. Math. (2004)

Keyphrases

variable neighborhood search
graph theory
minimum spanning tree
tabu search
metaheuristic
traveling salesman problem
vehicle routing problem
routing problem
spanning tree
heuristic methods
special case
hybrid method
single machine scheduling problem
path relinking
graph structure
search procedure