A line-expansion algorithm for the general routing problem with a guaranteed solution.

Walter Heyns Willy Sansen Herman Beke

Published in: DAC (1980)

Keyphrases

routing problem
optimal solution
dynamic programming
search space
worst case
optimization algorithm
genetic algorithm
objective function
special case
search strategy
web services
lower bound
np hard