Polynomial Time Algorithm and Its Heuristics to Find the Best Move of a Very Large-Scale Neighborhood Search Technique.

Published in: JCIS (2002)

Keyphrases

computational complexity
worst case
neighborhood search
dynamic programming
special case
simulated annealing
heuristic methods
cost function
optimization algorithm
search space
np hard
objective function
computational efficiency
hybrid algorithm
benchmark problems
memory efficient