How to collect balls moving in the Euclidean plane
type: Item
instance of: scholarly article
title: How to collect balls moving in the Euclidean plane
zbMATH Open document ID: 1130.90012
author: Yuichi Asahiro
author: Takashi Horiyama
author: Kazuhisa Makino
author: Hirotaka Ono
author: Toshinori Sakuma
author: Masafumi Yamashita
published in: Discrete Applied Mathematics
publication date: 2007-01-09T00:00:00Z
Mathematics Subject Classification ID: 90B20
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5083137
zbMATH Keywords: moving-target TSP
zbMATH Keywords: vehicle routing problem
zbMATH Keywords: partially ordered set
zbMATH Keywords: combinatorial optimization
MaRDI profile type: Publication
full work available at URL: j.dam.2006.04.020
OpenAlex ID: W1994508893
cites work: Q3056948
cites work: How to collect balls moving in the Euclidean plane
cites work: Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
cites work: Scheduling Deteriorating Jobs on a Single Processor
cites work: Q4371290
cites work: On the Complexity of Timetable and Multicommodity Flow Problems
cites work: Q4198056
cites work: Automata, languages and programming. 26th international colloquium, ICALP `99. Prague, Czech Republic, July 11--15, 1999. Proceedings
cites work: Q4252041
cites work: Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
cites work: Q5585020
cites work: Matching theory
cites work: On the Complexity of Scheduling with Batch Setup Times
cites work: V-Shaped Policies for Scheduling Deteriorating Jobs
cites work: Routing and Scheduling on a Shoreline with Release Times
cites work: Special cases of traveling salesman and repairman problems with time windows
cites work: Scheduling Groups of Jobs on a Single Machine
DOI: 10.1016/J.DAM.2006.04.020
description: scientific article; zbMATH DE number 5083137