Asymmetric Rendezvous on the Line Is a Double Linear Search Problem

References

• Alpern S. The rendezvous search problem. SIAM J. Control Optim. (1995) 33(3):673–683Crossref, Google Scholar
• Alpern S., Beck A. Rendezvous search on the line with bounded resources: Expected time minimization. Eur. J. Oper. Res. (1997) 101(3Crossref, Google Scholar
• Alpern S., Gal S. Rendezvous search on the line with distinguishable players. SIAM J. Control Optim. (1995) 33(4):1270–1276Crossref, Google Scholar
• Alpern S., Howard J. V. Alternating search at two locations. (1998) . preprintGoogle Scholar
• Anderson E. J., Essegaier S. Rendezvous search on the line with indistinguishable players. SIAM J. Control Optim. (1995) 33:1637–1642Crossref, Google Scholar
• Baston V. J. To appear. Two rendezvous search problems on the line. Naval Res. Quart.Google Scholar
• Baston V. J., Gal S. Rendezvous on the line when the players' initial distance is given by an unknown probability distribution. SIAM J. Control Optim. (1998) 36(6):1880–1889Crossref, Google Scholar
• Beck A. On the linear search problem. Israel J. Math. (1964) 2:221–228Crossref, Google Scholar
• Foley R. D., Hill T. P., Spruill M. C. Linear search with bounded resources. Naval Res. Logist. (1991) 38(4):555–566Crossref, Google Scholar
• Gal S. Rendezvous search on the line. Oper. Res. (1998) . to appearGoogle Scholar
• Howard J. V. Rendezvous search on the interval and circle. Oper. Res. (1998) . in pressGoogle Scholar
• Lim W. S., Alpern S. Minimax rendezvous on the line. SIAM J. Control Optim. (1996) 34(5):1650–1665Crossref, Google Scholar
• Lim W. S., Alpern S. Minimax triple rendezvous on the line: Corrections and extensions. (1997) . preprintGoogle Scholar
• Lim W. S., Alpern S., Beck A. Rendezvous search on the line with more than two players. Oper. Res. (1997) 45(3):357–364Link, Google Scholar