Arrival and service time dependencies in the single- and multi-visit selective traveling salesman problem
From MaRDI portal
Publication:6568425
DOI10.1016/J.COR.2024.106632MaRDI QIDQ6568425
Gilbert Laporte, David Canca, Eva Barrena
Publication date: 8 July 2024
Published in: Computers \& Operations Research (Search for Journal in Brave)
selective traveling salesman problemservice time-dependent profitsingle- and multi-visittime-dependent service time
Cites Work
- The traveling salesman problem with time-dependent service times
- Orienteering problem: a survey of recent variants, solution approaches and applications
- The orienteering problem: a survey
- The selective travelling salesman problem
- A matheuristic approach to the orienteering problem with service time dependent profits
- An integer programming approach for the time-dependent traveling salesman problem with time windows
- The traveling purchaser problem with time-dependent quantities
- Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version
- An enhanced lower bound for the time-dependent travelling salesman problem
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
- Analysis of the selective traveling salesman problem with time-dependent profits
- Generalized orienteering problem with resource dependent rewards
- An iterated local search algorithm for the team orienteering problem with variable profits
- Team Orienteering with Time-Varying Profit
- The orienteering problem with variable profits
- The maximum collection problem with time-dependent rewards
This page was built for publication: Arrival and service time dependencies in the single- and multi-visit selective traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6568425)