AN EXACTLY OPTIMAL STRATEGY FOR A SEARCH PROBLEM WITH TRAVELING COST

DOI10.15807/JORSJ.34.436MaRDI QIDQ4018348zbMATH OpenOpenAlexFDO

Authors Kensaku Kikuta

Publication date 16 January 1993

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.34.436

zbMATH Keywords

traveling costexactly optimal strategyneighboring cells in a straight lineprobability of overlooking

Mathematics Subject Classification ID

Search theory (90B40) 2-person games (91A05)

Recommendations

• A ONE-DIMENSIONAL SEARCH WITH TRAVELING COST
• Search problem with two levels of examination costs
• A SEARCH GAME WITH TRAVELING COST
• Optimal search for a randomly moving object
• Asymptotic analysis of dichotomous search with search and travel costs

Cited in

(7)

• Search problem with two levels of examination costs
• Asymptotic analysis of dichotomous search with search and travel costs
• A ONE-DIMENSIONAL SEARCH WITH TRAVELING COST
• Optimal jumping patterns
• Optimal search with positive switch cost is NP-hard
• Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
• A search problem on a bipartite network

This page was built for publication: AN EXACTLY OPTIMAL STRATEGY FOR A SEARCH PROBLEM WITH TRAVELING COST

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018348)