The multiple traveling salesmen problem with moving targets
DOI10.1007/S11590-014-0835-6zbMATH Open1335.90084OpenAlexW2050965489MaRDI QIDQ895767FDOQ895767
Authors: Anke Stieber, Maria Epp, Matthias Knapp, Hendrik Rothe, Armin Fügenschuh 
Publication date: 4 December 2015
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-014-0835-6
Recommendations
- The Multiple Traveling Salesmen Problem with Moving Targets and Nonlinear Trajectories
- The moving-target traveling salesman problem
- scientific article; zbMATH DE number 1305099
- The single line moving target traveling salesman problem with release times
- Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Integer programming (90C10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The traveling salesman. Computational solutions for RSP applications
- The moving-target traveling salesman problem
- Improving hit-and-run for global optimization
- Computational Integer Programming and Cutting Planes
- Title not available (Why is that?)
Cited In (7)
- The moving-target traveling salesman problem
- Dealing with time in the multiple traveling salespersons problem with moving targets
- The single line moving target traveling salesman problem with release times
- Title not available (Why is that?)
- Traveling Salesperson Problems for the Dubins Vehicle
- The vehicle routing problem with floating targets: formulation and solution approaches
- The Multiple Traveling Salesmen Problem with Moving Targets and Nonlinear Trajectories
Uses Software
This page was built for publication: The multiple traveling salesmen problem with moving targets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q895767)
