| Article ID: | iaor20031877 |
| Country: | United States |
| Volume: | 50 |
| Issue: | 5 |
| Start Page Number: | 772 |
| End Page Number: | 795 |
| Publication Date: | Sep 2002 |
| Journal: | Operations Research |
| Authors: | Alpern Steve |
The rendezvous-search problem was posed by the author 25 years ago. In its basic form, it asks how two unit speed players can find each other in least expected time, when randomly placed in a known dark region. The problem received little attention until about 10 years ago. This article surveys the rapid progress that has been made since then, and also presents some new results.