Asymmetric Rendezvous on the Line Is a Double Linear Search Problem
暂无分享,去创建一个
[1] J. V. Howard. Rendezvous Search on the Interval and the Circle , 1999, Oper. Res..
[2] S. Alpern,et al. Minimax Rendezvous on the Line , 1996 .
[3] A. Beck. On the linear search problem , 1964 .
[4] Theodore P. Hill,et al. Linear search with bounded resources , 1991 .
[5] S. Gal,et al. Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution , 1998 .
[6] V. J. Baston. Note : Two rendezvous search problems on the line , 1999 .
[7] Steve Alpern,et al. Rendezvous search on the line with bounded resources: expected time minimization , 1997 .
[8] S. Gal,et al. Rendezvous Search on the Line With Distinguishable Players , 1995 .
[9] E. Anderson,et al. Rendezvous Search on the Line with Indistinguishable Players , 1995 .
[10] Steve Alpern,et al. Alternating Search at Two Locations , 2000 .
[11] Steve Alpern,et al. Rendezvous Search on the Line with More Than Two Players , 1997, Oper. Res..
[12] S. Alpern. The Rendezvous Search Problem , 1995 .
[13] Shmuel Gal. Rendezvous Search on the Line , 1999, Oper. Res..