The generalized close enough traveling salesman problem-Reference-Cited by-同舟云学术

The generalized close enough traveling salesman problem

Published:2023-11 Issue:3 Volume:310 Page:974-991
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Di Placido Andrea^ORCID,Archetti Claudia^ORCID,Cerrone Carmine^ORCID,Golden Bruce^ORCID

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference22 articles.

1. Approximation algorithms for the geometric covering salesman problem;Arkin;Discrete Applied Mathematics,1994

2. An integer-programming-based approach to the close-enough traveling salesman problem;Behdani;INFORMS Journal on Computing,2014

3. Improving search in genetic algorithms;Booker;Genetic Algorithms and Simulated Annealing,1987

4. Improved upper and lower bounds for the close enough traveling salesman problem;Carrabs,2017

5. A novel discretization scheme for the close enough traveling salesman problem;Carrabs;Computers and Operations Research,2017

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A unifying framework for selective routing problems;European Journal of Operational Research;2025-01

2. On solving close enough orienteering problems with overlapped neighborhoods;European Journal of Operational Research;2024-10

3. Autonomous data detection and inspection with a fleet of UAVs;Computers & Operations Research;2024-08

4. Route Planning through Genetic Algorithm for Multi-Axis Motion Control;2024 IEEE Conference on Artificial Intelligence (CAI);2024-06-25

5. An effective memetic algorithm for the close-enough traveling salesman problem;Applied Soft Computing;2024-03