A Multi-start Iterated Local Search Algorithm with Variable Degree of Perturbation for the Covering Salesman Problem
- 24 August 2018
- book chapter
- Published by Springer Nature
- p. 279-292
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Combining ant colony optimization algorithm and dynamic programming technique for solving the covering salesman problemComputers & Industrial Engineering, 2015
- An integer programming-based local search for the covering salesman problemComputers & Operations Research, 2012
- The Generalized Covering Salesman ProblemINFORMS Journal on Computing, 2012
- The Ring Star Problem: Polyhedral analysis and exact algorithmNetworks, 2004
- Heuristics for the multi-vehicle covering tour problemComputers & Operations Research, 2000
- The Covering Tour ProblemOperations Research, 1997
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman ProblemOperations Research, 1997
- Approximation algorithms for the geometric covering salesman problemDiscrete Applied Mathematics, 1994
- The Covering Salesman ProblemTransportation Science, 1989
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973