scientific article; zbMATH DE number 1305099

MaRDI QIDQ4252041zbMATH OpenFDO

Authors C. S. Helvig, Gabriel Robins, Alex Zelikovsky

Publication date 17 June 1999

zbMATH Keywords

time-dependent generalizationtraveling salesman

Mathematics Subject Classification ID

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

Recommendations

• The moving-target traveling salesman problem
• The single line moving target traveling salesman problem with release times
• The travelling-salesman problem with moving objects
• The Multiple Traveling Salesmen Problem with Moving Targets and Nonlinear Trajectories
• The multiple traveling salesmen problem with moving targets

Cited in

(18)

• Approximation results for kinetic variants of TSP
• The travelling-salesman problem with moving objects
• VectorTSP: a traveling salesperson problem with racetrack-like acceleration constraints
• Dealing with time in the multiple traveling salespersons problem with moving targets
• The single line moving target traveling salesman problem with release times
• Grasp and delivery for moving objects on broken lines
• On a dynamic traveling salesman problem
• FAST PURSUIT OF MOBILE NODES USING TPR TREES
• The Multiple Traveling Salesmen Problem with Moving Targets and Nonlinear Trajectories
• The moving-target traveling salesman problem
• A traveller's problem
• The target visitation problem
• About Construction of Realizability Arias of Salesman Strategies in Dynamic Salesmen Problem
• New bounds for single-machine time-dependent scheduling with uniform deterioration
• A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme
• Competitive perimeter defense in linear environments
• How to collect balls moving in the Euclidean plane
• The multiple traveling salesmen problem with moving targets

This page was built for publication:

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