Improving CP-based local branching via sliced neighborhood search.

Fabio Parisini Michela Milano

Published in: SAC (2011)

Keyphrases

neighborhood search
simulated annealing
traveling salesman problem
nature inspired
branch and bound
graph search
path relinking
constraint programming
search tree
heuristic methods
genetic algorithm
upper bound
variable neighborhood search