Kikuta, Kensaku; Ruckle, William H. - In: European Journal of Operational Research 207 (2010) 1, pp. 78-82
In a rendezvous search two or more teams called seekers try to minimize the time needed to find each other. In this paper, we consider two seekers in the plane. This is a one sided problem since Seeker 1 begins at a predetermined point O. Seeker 2 begins at one of a finite set of points xi with...
