Line-of-sight rendezvous
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Steve Alpern & Anatole Beck, 1999. "Asymmetric Rendezvous on the Line Is a Double Linear Search Problem," Mathematics of Operations Research, INFORMS, vol. 24(3), pages 604-618, August.
- Shmuel Gal, 1999. "Rendezvous Search on the Line," Operations Research, INFORMS, vol. 47(6), pages 974-976, December.
- Steve Alpern & Vic Baston, 2005. "Rendezvous on a Planar Lattice," Operations Research, INFORMS, vol. 53(6), pages 996-1006, December.
- J. V. Howard, 1999. "Rendezvous Search on the Interval and the Circle," Operations Research, INFORMS, vol. 47(4), pages 550-558, August.
- Edward J. Anderson & Sándor P. Fekete, 2001. "Two Dimensional Rendezvous Search," Operations Research, INFORMS, vol. 49(1), pages 107-118, February.
- Elizabeth J. Chester & Reha H. Tütüncü, 2004. "Rendezvous Search on the Labeled Line," Operations Research, INFORMS, vol. 52(2), pages 330-334, April.
- Steve Alpern, 2002. "Rendezvous Search: A Personal Perspective," Operations Research, INFORMS, vol. 50(5), pages 772-795, October.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Cheng-Shang Chang & Wanjiun Liao & Ching-Min Lien, 2015. "On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous," Mathematics of Operations Research, INFORMS, vol. 40(1), pages 1-23, February.
- Pierre Leone & Steve Alpern, 2018. "Rendezvous search with markers that can be dropped at chosen times," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(6-7), pages 449-461, September.
- Leone, Pierre & Buwaya, Julia & Alpern, Steve, 2022. "Search-and-rescue rendezvous," European Journal of Operational Research, Elsevier, vol. 297(2), pages 579-591.
- Steve Alpern, 2002. "Rendezvous Search: A Personal Perspective," Operations Research, INFORMS, vol. 50(5), pages 772-795, October.
- Alpern, Steve & Baston, Vic, 2006. "A common notion of clockwise can help in planar rendezvous," European Journal of Operational Research, Elsevier, vol. 175(2), pages 688-706, December.
- Pierre Leone & Steve Alpern, 2022. "A Symbolic Programming Approach to the Rendezvous Search Problem," SN Operations Research Forum, Springer, vol. 3(1), pages 1-29, March.
- Steve Alpern & Thomas Lidbetter, 2013. "Mining Coal or Finding Terrorists: The Expanding Search Paradigm," Operations Research, INFORMS, vol. 61(2), pages 265-279, April.
- Steve Alpern, 2011. "Find-and-Fetch Search on a Tree," Operations Research, INFORMS, vol. 59(5), pages 1258-1268, October.
- Steve Alpern & Li Zeng, 2022. "Social Distancing, Gathering, Search Games: Mobile Agents on Simple Networks," Dynamic Games and Applications, Springer, vol. 12(1), pages 288-311, March.
- Steve Alpern & Anatole Beck, 2000. "Pure Strategy Asymmetric Rendezvous on the Line with an Unknown Initial Distance," Operations Research, INFORMS, vol. 48(3), pages 498-501, June.
- Alpern, Steve & Katrantzi, Ioanna, 2009. "Equilibria of two-sided matching games with common preferences," European Journal of Operational Research, Elsevier, vol. 196(3), pages 1214-1222, August.
- Steve Alpern & Vic Baston, 2005. "Rendezvous on a Planar Lattice," Operations Research, INFORMS, vol. 53(6), pages 996-1006, December.
- Steve Alpern & Thomas Lidbetter, 2015. "Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object," Operations Research, INFORMS, vol. 63(1), pages 122-133, February.
- Steve Alpern, 2002. "Rendezvous search on labeled networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(3), pages 256-274, April.
- Steve Alpern, 2017. "Hide-and-Seek Games on a Network, Using Combinatorial Search Paths," Operations Research, INFORMS, vol. 65(5), pages 1207-1214, October.
- Steve Alpern & Thomas Lidbetter, 2014. "Searching a Variable Speed Network," Mathematics of Operations Research, INFORMS, vol. 39(3), pages 697-711, August.
- Edward J. Anderson & Sándor P. Fekete, 2001. "Two Dimensional Rendezvous Search," Operations Research, INFORMS, vol. 49(1), pages 107-118, February.
- Steve Alpern & Shmuel Gal, 2002. "Searching for an Agent Who May OR May Not Want to be Found," Operations Research, INFORMS, vol. 50(2), pages 311-323, April.
- Steve Alpern & Wei Shi Lim, 2002. "Rendezvous of three agents on the line," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(3), pages 244-255, April.
- Alpern, Steven & Lidbetter, Thomas, 2015. "Optimal trade-off between speed and acuity when searching for a small object," LSE Research Online Documents on Economics 61504, London School of Economics and Political Science, LSE Library.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:188:y:2008:i:3:p:865-883. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.