Dealing with time in the multiple traveling salespersons problem with moving targets
From MaRDI portal
Publication:2155136
DOI10.1007/s10100-020-00712-7OpenAlexW3092744298MaRDI QIDQ2155136
Anke Stieber, Armin Fügenschuh
Publication date: 15 July 2022
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-020-00712-7
integer linear programmingsecond-order cone programmingmoving targetstime-relaxationdynamic traveling salespersons problem
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Time-dependent routing problems: a review
- How to collect balls moving in the Euclidean plane
- The multiple traveling salesmen problem with moving targets
- A way to optimally solve a time-dependent vehicle routing problem with time windows
- Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
- The traveling salesman. Computational solutions for RSP applications
- Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm
- A dynamic vehicle routing problem with time-dependent travel times
- Vehicle dispatching with time-dependent travel times
- The time dependent traveling salesman problem: polyhedra and algorithm
- An efficient transformation of the generalized vehicle routing problem
- A queueing framework for routing problems with time-dependent travel times
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
- Integer Programming Formulation of Traveling Salesman Problems
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- An Efficient Transformation Of The Generalized Traveling Salesman Problem
- The Multiple Traveling Salesmen Problem with Moving Targets and Nonlinear Trajectories
- The moving-target traveling salesman problem
- Scheduling and Routing of Fly-in Safari Planes Using a Flow-over-Flow Model
- Constructing Maximal Dynamic Flows from Static Flows
- Integer Programming and Combinatorial Optimization
