A novel discretization scheme for the close enough traveling salesman problem
Authors:
- Francesco CarrabsFCFrancesco Carrabs
- Carmine CerroneCCCarmine Cerrone
- Raffaele CerulliRCRaffaele Cerulli
- Manlio GaudiosoMGManlio Gaudioso
- 1 February 2017
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 78, 163-171
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman ProblemINFORMS Journal on Computing, 2014
- A Steiner-Zone Heuristic for Solving the Close-Enough Traveling Salesman Problem2011
- Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network2008
- On the Optimal Robot Routing Problem in Wireless Sensor NetworksIEEE Transactions on Knowledge and Data Engineering, 2007
- Heuristic Approaches for a TSP Variant: The Automatic Meter Reading Shortest Tour Problem2007
- The Generalized Traveling Salesman and Orienteering Problems2007
- The Close Enough Traveling Salesman Problem: A Discussion of Several Heuristics2006
- Approximation algorithms for TSP with neighborhoods in the planeJournal of Algorithms, 2003
- Approximation algorithms for geometric tour and network design problems (extended abstract)1995
- Approximation algorithms for the geometric covering salesman problemDiscrete Applied Mathematics, 1994