On Some Generalizations of the Travelling-Salesman Problem
From MaRDI portal
Publication:3765575
DOI10.2307/2582232zbMath0628.90086MaRDI QIDQ3765575
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
90C35: Programming involving graphs or networks
Related Items
On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem, A tabu search heuristic for the vehicle routing problem with private fleet and common carrier, The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem, An efficient composite heuristic for the symmetric generalized traveling salesman problem, On the generalized 2-peripatetic salesman problem, Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem, A stabilized column generation scheme for the traveling salesman subtour problem