Improved Bounds for the Symmetric Rendezvous Value on the Line
From MaRDI portal
Publication:3392207
DOI10.1287/opre.1070.0439zbMath1167.91322OpenAlexW2099943113WikidataQ58051162 ScholiaQ58051162MaRDI QIDQ3392207
Qiaoming Han, Luis F. Zuluaga, Dong-lei Du, Juan Carlos Vera
Publication date: 13 August 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1070.0439
Semidefinite programming (90C22) Search theory (90B40) Positional games (pursuit and evasion, etc.) (91A24)
Related Items (8)
A symbolic programming approach to the rendezvous search problem ⋮ Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object ⋮ Rendezvous Problem ⋮ Ten Open Problems in Rendezvous Search ⋮ Search-and-rescue rendezvous ⋮ Deterministic symmetric rendezvous with tokens in a synchronous torus ⋮ Rendezvous Search with Revealed Information: Applications to the Line ⋮ Rendezvous search with markers that can be dropped at chosen times
Uses Software
This page was built for publication: Improved Bounds for the Symmetric Rendezvous Value on the Line
