An Insert/Delete Heuristic for the Travelling Salesman Subset-Tour Problem with One Additional Constraint
From MaRDI portal
Publication:4006902
DOI10.1057/jors.1992.37zbMath0751.90079MaRDI QIDQ4006902
John Mittenthal, Charles E. Noon
Publication date: 27 September 1992
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1992.37
heuristic approach; travelling salesman subset-tour problem; Travelling Salesman Subset-tour Problem
90C35: Programming involving graphs or networks
90C10: Integer programming
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Heuristic algorithms for visiting the customers in a rolling schedule environment, A fast and effective heuristic for the orienteering problem, The median tour and maximal covering tour problems: Formulations and heuristics, A TSSP+1 decomposition strategy for the vehicle routing problem, Routing problems: A bibliography, A parallel implementation of the TSSP+1 decomposition for the capacity-constrained vehicle routing problem, A stabilized column generation scheme for the traveling salesman subtour problem, A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs
