Line-of-sight rendezvous
From MaRDI portal
Publication:2475830
DOI10.1016/j.ejor.2007.03.043zbMath1144.90496OpenAlexW2032007320MaRDI QIDQ2475830
Publication date: 11 March 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.03.043
Related Items (1)
Cites Work
- Unnamed Item
- The theory of search games and rendezvous.
- Asymmetric rendezvous search on the circle
- A common notion of clockwise can help in planar rendezvous
- Rendezvous Search on the Interval and the Circle
- Rendezvous in Higher Dimensions
- Two Dimensional Rendezvous Search
- Rendezvous Search: A Personal Perspective
- Rendezvous Search on the Labeled Line
- Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
- Note: Two rendezvous search problems on the line
- Rendezvous search on a graph
- Many-player rendezvous search: Stick together or split and meet?
- Rendezvous search when marks are left at the starting points
- Searching for targets who want to be found
- A rendezvous-evasion game on discrete locations with joint randomization
- Rendezvous search on labeled networks
- Rendezvous Search on the Line
- The Rendezvous Search Problem
- Rendezvous Search on the Line with Distinguishable Players
- Rendezvous Search on the Line with Indistinguishable Players
- Co-ordinating Two Searchers for an Object Hidden on an Interval
- Asymmetric Rendezvous on the Line Is a Double Linear Search Problem
- Walking streets faster
- Rendezvous on a Planar Lattice
- Alternating search at two locations
This page was built for publication: Line-of-sight rendezvous
