The single line moving target traveling salesman problem with release times
From MaRDI portal
(Redirected from Publication:2158632)
Recommendations
Cites work
- Approximating Capacitated Routing and Delivery Problems
- Approximation results for kinetic variants of TSP
- Metaheuristics: A bibliography
- Routing and Scheduling on a Shoreline with Release Times
- Special cases of traveling salesman and repairman problems with time windows
- The moving-target traveling salesman problem
- Vehicle scheduling on a tree with release and handling times
Cited in
(6)- A customized genetic algorithm for bi-objective routing in a dynamic network
- scientific article; zbMATH DE number 1305099 (Why is no real title available?)
- The Multiple Traveling Salesmen Problem with Moving Targets and Nonlinear Trajectories
- A bi-criteria moving-target travelling salesman problem under uncertainty
- A uniform sampling method for permutation space
- The multiple traveling salesmen problem with moving targets
This page was built for publication: The single line moving target traveling salesman problem with release times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2158632)