Rendezvous search on the line with bounded resources: expected time minimization-Reference-Cited by-同舟云学术

Rendezvous search on the line with bounded resources: expected time minimization

Published:1997-09 Issue:3 Volume:101 Page:588-597
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Alpern Steve,Beck Anatole

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference19 articles.

1. The rendezvous search problem;Alpern;SIAM Journal of Control and Optimization,1995

2. Rendezvous search on the line with distinguishable players;Alpern;SIAM Journal of Control and Optimization,1995

3. Rendezvous search on the line with indistinguishable players;Anderson;SIAM Journal of Control and Optimization,1995

4. The rendezvous problem on discrete locations;Anderson;Journal of Applied Probability,1990

5. Baston, V.J., “The two player rendezvous value on the line”, preprint.

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks;New Journal of Physics;2023-01-01

2. Search-and-rescue rendezvous;European Journal of Operational Research;2022-03

3. Optimal pinging frequencies in the search for an immobile beacon;IIE Transactions;2015-12-15

4. Rendezvous Search Games;Wiley Encyclopedia of Operations Research and Management Science;2011-02-15

5. Rendezvous Search: A Personal Perspective;Operations Research;2002-10