Login / Signup

Efficiently solvable special cases of bottleneck travelling salesman problems.

Rainer E. BurkardW. Sandholzer
Published in: Discret. Appl. Math. (1991)
Keyphrases
  • special case
  • travelling salesman
  • np complete
  • np hard
  • optimization problems
  • computational complexity
  • objective function
  • optimal solution