Rendezvous Search on the Line with Limited Resources: Maximizing the Probability of Meeting
From MaRDI portal
Publication:4545654
DOI10.1287/opre.47.6.849zbMath1042.91516OpenAlexW1989517162MaRDI QIDQ4545654
Publication date: 1999
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.47.6.849
Related Items (6)
A symbolic programming approach to the rendezvous search problem ⋮ Rendezvous of three agents on the line ⋮ Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks ⋮ Ten Open Problems in Rendezvous Search ⋮ Search-and-rescue rendezvous ⋮ Rendezvous search with markers that can be dropped at chosen times
This page was built for publication: Rendezvous Search on the Line with Limited Resources: Maximizing the Probability of Meeting