The Multiple Traveling Salesmen Problem with Moving Targets and Nonlinear Trajectories

DOI10.1007/978-3-319-89920-6_65zbMath1397.90339OpenAlexW2804957433MaRDI QIDQ4685796

Armin Fügenschuh, Anke Stieber

Publication date: 9 October 2018

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-89920-6_65

zbMATH Keywords

integer linear programmingmoving targetsdynamic traveling salesmen problemnon-linear trajectories

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items

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

Uses Software

• CPLEX

Cites Work

• The multiple traveling salesmen problem with moving targets
• Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
• A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
• The moving-target traveling salesman problem
• Unnamed Item