Rendezvous search on the line with bounded resources: Expected time minimization
type: Item
instance of: scholarly article
title: Rendezvous search on the line with bounded resources: Expected time minimization
zbMATH Open document ID: 0930.90043
DOI: 10.1016/S0377-2217(96)00192-0
author: Steve Alpern
author: Anatole Beck
published in: European Journal of Operational Research
publication date: 2000-02-17T00:00:00Z
Mathematics Subject Classification ID: 90B40
Mathematics Subject Classification ID: 91A05
zbMATH DE Number: 1255883
zbMATH Keywords: rendezvous search on the line
zbMATH Keywords: linear search problem
MaRDI profile type: Publication
cites work: The Rendezvous Search Problem
cites work: Rendezvous Search on the Line with Distinguishable Players
cites work: Rendezvous Search on the Line with Indistinguishable Players
cites work: The rendezvous problem on discrete locations
cites work: Note: Two rendezvous search problems on the line
cites work: On the linear search problem
cites work: Q3813592
cites work: Linear search with bounded resources
cites work: Search games
cites work: Minimal Length Curves That Are Not Embeddable in an Open Planar Set: The Problem of a Lost Swimmer with a Compass
cites work: Minimax Rendezvous on the Line
cites work: Rendezvous Search on the Line with More Than Two Players
cites work: Co-ordinating Two Searchers for an Object Hidden on an Interval
cites work: Q5731904
cites work: Q3670933
cites work: Finding Your Kids When They Are Lost
cites work: Searching for targets who want to be found
full work available at URL: s0377-2217(96)00192-0
OpenAlex ID: W1999127560
description: scientific article; zbMATH DE number 1255883