-Chinese postman problem.

Dino Ahr Gerhard Reinelt

Published in: Comput. Oper. Res. (2006)

Keyphrases

polynomially solvable
processing times
special case
np hard
np complete
minimum cost
neural network
decision trees
nearest neighbor
tabu search
min max
tabu search algorithm