A ONE-DIMENSIONAL SEARCH WITH TRAVELING COST

DOI10.15807/JORSJ.33.262zbMath0718.90048OpenAlexW231868351MaRDI QIDQ5750706

Kensaku Kikuta

Publication date: 1990

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.33.262

zbMATH Keywords

neighboring cells in a straight lineApproximately optimal search strategiesBellman's Principle of Optimality

Mathematics Subject Classification ID

Search theory (90B40)

Related Items (4)

Rendezvous of three agents on the line ⋮ Accumulation games. I: Noisy search ⋮ A search problem on a bipartite network ⋮ Asymptotic analysis of dichotomous search with search and travel costs

This page was built for publication: A ONE-DIMENSIONAL SEARCH WITH TRAVELING COST