How to collect balls moving in the Euclidean plane

DOI10.1016/J.DAM.2006.04.020zbMath1130.90012OpenAlexW1994508893MaRDI QIDQ860383

Yuichi Asahiro, Hirotaka Ono, Toshinori Sakuma, Masafumi Yamashita, Kazuhisa Makino, Takashi Horiyama

Publication date: 9 January 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.04.020

zbMATH Keywords

combinatorial optimizationpartially ordered setvehicle routing problemmoving-target TSP

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Traffic problems in operations research (90B20)

Related Items (3)

Dealing with time in the multiple traveling salespersons problem with moving targets ⋮ The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches ⋮ Grasp and delivery for moving objects on broken lines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching theory
• Automata, languages and programming. 26th international colloquium, ICALP `99. Prague, Czech Republic, July 11--15, 1999. Proceedings
• Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
• Routing and Scheduling on a Shoreline with Release Times
• Scheduling Deteriorating Jobs on a Single Processor
• Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
• Special cases of traveling salesman and repairman problems with time windows
• V-Shaped Policies for Scheduling Deteriorating Jobs
• On the Complexity of Timetable and Multicommodity Flow Problems
• On the Complexity of Scheduling with Batch Setup Times
• Scheduling Groups of Jobs on a Single Machine

This page was built for publication: How to collect balls moving in the Euclidean plane