Search problem with two levels of examination costs

MaRDI QIDQ3619690zbMATH OpenFDO

Authors Kensaku Kikuta

Publication date 8 April 2009

Full work available at URL http://www.jams.or.jp/scm/abstract/e-2008/2008-53a.txt

zbMATH Keywords

examination costexpected costminimizationsearch problemsequencingtraveling cost

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Search theory (90B40)

Recommendations

• AN EXACTLY OPTIMAL STRATEGY FOR A SEARCH PROBLEM WITH TRAVELING COST
• A ONE-DIMENSIONAL SEARCH WITH TRAVELING COST
• A search problem on a bipartite network
• Optimal search for a randomly moving object
• A search game with unknown examination costs and travel times

Cited in

(5)

• Optimal search with positive switch cost is NP-hard
• A search problem on a bipartite network
• Minimizing the average searching time for an object within a graph
• AN EXACTLY OPTIMAL STRATEGY FOR A SEARCH PROBLEM WITH TRAVELING COST
• A ONE-DIMENSIONAL SEARCH WITH TRAVELING COST

This page was built for publication: Search problem with two levels of examination costs

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