Dealing with time in the multiple traveling salespersons problem with moving targets

DOI10.1007/S10100-020-00712-7OpenAlexW3092744298MaRDI QIDQ2155136FDOQ2155136

Authors: 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

zbMATH Keywords

integer linear programmingmoving targetssecond-order cone programmingtime-relaxationdynamic traveling salespersons problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Title not available (Why is that?)
• A note on two problems in connexion with graphs
• Title not available (Why is that?)
• Integer Programming Formulation of Traveling Salesman Problems
• Title not available (Why is that?)
• The traveling salesman. Computational solutions for RSP applications
• 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
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• Constructing Maximal Dynamic Flows from Static Flows
• Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm
• The moving-target traveling salesman problem
• A dynamic vehicle routing problem with time-dependent travel times
• A way to optimally solve a time-dependent vehicle routing problem with time windows
• 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
• Time-dependent routing problems: a review
• Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
• An Efficient Transformation Of The Generalized Traveling Salesman Problem
• Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
• Integer Programming and Combinatorial Optimization
• Scheduling and Routing of Fly-in Safari Planes Using a Flow-over-Flow Model
• Title not available (Why is that?)
• How to collect balls moving in the Euclidean plane
• The multiple traveling salesmen problem with moving targets
• The Multiple Traveling Salesmen Problem with Moving Targets and Nonlinear Trajectories

Cited In (3)

• Minimum-time interception of a moving target by a material point in a viscous medium
• A bi-criteria moving-target travelling salesman problem under uncertainty
• The Multiple Traveling Salesmen Problem with Moving Targets and Nonlinear Trajectories

This page was built for publication: Dealing with time in the multiple traveling salespersons problem with moving targets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2155136)