Note: Two Rendezvous Search Problems on the Line

Naval Research Logistics

Volumn 46, Issue 2-3, 1999, Pages 335-340

  Baston, Vic ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

Linear search; Rendezvous

Indexed keywords

OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES;

LINEAR SEARCH; TWO-PERSON SYMMETRIC RENDEZVOUS VALUES;

LOGISTICS;

EID: 0033114860     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/(sici)1520-6750(199904)46:3<335::aid-nav6>3.0.co;2-q     Document Type: Article

References (8)

1. S. Alpern, The rendezvous search problem, SIAM J Control Optim 33 (1995), 673-683.
2. S. Alpern and A. Beck, Rendezvous search on the line with hounded resources: Expected time minimization, Eur J Oper Res 101 (1997), 588-597.
3. S. Alpern and S. Gal, The rendezvous search problem on the line with distinguishable players, SIAM J Control Optim 33 (1995), 1270-1276.
4. S. Alpern and W. S. Lim, The symmetric rendezvous-evasion game, SIAM J Control Optim, 36 (1998), 948-959.
5. E. J. Anderson and S. Essegaier, Rendezvous search on the line with distinguishable players, SIAM J Control Optim 33 (1995), 1637-1642.
6. W. S. Lim and S. Alpern, Minimax rendezvous search on the line, SIAM J Control Optim 34 (1996), 1650-1665.
7. W. S. Lim, S. Alpern, and A. Beck, Rendezvous search on the line with more than two players, Oper Res 45 (1997), 357-364.
8. T. C. Schelling, The strategy of conflict, Harvard University Press, Cambridge, 1960.