Rendezvous search: A personal perspective
成果类型：
Article
署名作者：
Alpern, S
署名单位：
University of London; London School Economics & Political Science
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.50.5.772.363
发表日期：
2002
页码：
772-795
关键词：
摘要：
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.