On Some Generalizations of the Travelling-Salesman Problem

DOI10.2307/2582232zbMath0628.90086OpenAlexW4242071465MaRDI QIDQ3765575

Roy Jonker, Ton Volgenant

Publication date: 1987

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2582232

zbMATH Keywords

sequencingshortest-path problemlongest-path problemgeneralized travelling-salesman problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

On the generalized 2-peripatetic salesman problem, The probabilistic travelling salesman problem with crowdsourcing, A stabilized column generation scheme for the traveling salesman subtour problem, On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem, The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem, A tabu search heuristic for the vehicle routing problem with private fleet and common carrier, Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem, An efficient composite heuristic for the symmetric generalized traveling salesman problem