Search for an immobile entity on a network

DOI10.1016/j.ejor.2007.08.032zbMath1149.90026OpenAlexW2068534561MaRDI QIDQ933506

Arun Jotshi, Rajan Batta

Publication date: 21 July 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.08.032

zbMATH Keywords

search problemschinese postman problemimmobile entity

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (6)

Infrastructure security games ⋮ A competitive search game with a moving target ⋮ Integer programming models and algorithms for the graph decontamination problem with mobile agents ⋮ Minimizing the average searching time for an object within a graph ⋮ Search for an immobile hider on a stochastic network ⋮ Searching a Variable Speed Network

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Network search games with immobile hider, without a designated searcher starting point
• Search games
• Hide and seek in a subset of the real line
• Complexity of searching an immobile hider in a graph
• On the optimality of a simple strategy for searching graphs
• The theory of search games and rendezvous.
• Search games with immobile hider
• Yet more on the linear search problem
• A general search game
• Searching symmetric networks with Utilitarian-Postman paths
• Hide-and-seek games on a tree to which Eulerian networks are attached
• Minimax Solutions for Linear Search Problems
• A Discrete Search Game
• A Stochastic Search Game
• Search Games with Mobile and Immobile Hider
• Searching for a particle on the real line
• Matching, Euler tours and the Chinese postman

This page was built for publication: Search for an immobile entity on a network