AN EXACTLY OPTIMAL STRATEGY FOR A SEARCH PROBLEM WITH TRAVELING COST

スポンサーリンク

概要

• 論文の詳細を見る

• There are n neighboring cells in a straight line. An object is in one of all cells. It is required to determine a strategy that will minimize the expected cost of finding the object. A probability of overlooking the object is equal to zero, when the right cell is searched. Associated with the examination are a traveling cost dependent on the distance from the last cell examined and a fixed examination cost. A procedure for finding an exactly optimal strategy is given.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Kikuta Kensaku

  Faculty Of Economics Toyama University

関連論文

• A SEARCH GAME WITH TRAVELING COST ON A TREE
• AN EXACTLY OPTIMAL STRATEGY FOR A SEARCH PROBLEM WITH TRAVELING COST
• A HIDE AND SEEK GAME WITH TRAVELING COST
• A ONE-DIMENSIONAL SEARCH WITH TRAVELING COST
• A SEARCH GAME WITH TRAVELING COST

スポンサーリンク