Search for an immobile entity on a network

European Journal of Operational Research

Volumn 191, Issue 2, 2008, Pages 347-359

  Jotshi, Arun ^a   Batta, Rajan ^b  

^a Macrosoft Inc   (United States)

^b State University of New York   (United States)

Author keywords

Chinese Postman problem; Immobile entity; Search problems

Indexed keywords

COMPUTATION THEORY; HEURISTIC ALGORITHMS; OPTIMIZATION;

CHINESE POSTMAN PROBLEM (CPP); IMMOBILE ENTITY; SEARCH PROBLEMS;

SEARCH ENGINES;

EID: 43849106771     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.08.032     Document Type: Article

References (27)

1. S. Alpern, Hide-and-seek games on a tree to which Eulerian networks are attached, Networks, in press.
2. S. Alpern, V. Baston, S. Gal, Network search games with immobile hider, without a designated searcher starting point, CDAM-2006-03, Center for Discrete and Applicable Mathematics, London School of Economics, England, 2006.
3. S. Alpern, V. Baston, S. Gal, Searching symmetric networks with utilitarian-postman paths, CDAM-2006-05, Center for Discrete and Applicable Mathematics, London School of Economics, England, 2006.
4. Alpern S., and Gal S. The Theory of Search Games and Rendezvous (2003), Kluwer Academic Publishers, Boston
5. Beck A., and Newman D. Yet more on the linear search problem. Israel J. Math. 8 (1970) 419-429
6. Bellman R. An optimal search. SIAM Rev. (1963) 274
7. Chudnovsky D., and Chudnovsky G. Search Theory: Some Recent Developments (1989), Marcel Dekker Publishers, New York
8. Edmonds J., and Johnson E. Matching, Euler tours and the Chinese Postman. Math. Program 5 (1973) 88-124
9. L. Euler, Solutio problematis ad geometrica situs pertinentis, Commentarii Academiae Scientarum Petropolitanae 8 (1736) 128-140.
10. Fristedt B. Hide and seek in a subset of the real line. Int. J. Game Theory 6 (1977) 135-165
11. Fristedt B., and Heath D. Searching for a particle on the real line. Adv. Appl. Prob. 6 (1974) 79-102
12. Gal S. A general search game. Israel J. Math. 12 (1972) 32-45
13. Gal S. A discrete search game. SIAM J. Appl. Math. 27 (1974) 641-648
14. Gal S. Minimax solutions for linear search problems. SIAM J. Appl. Math. 27 (1974) 17-30
15. Gal S. A stochastic search game. SIAM J. Appl. Math. 34 134 (1978) 205-210
16. Gal S. Search games with mobile and immobile hider. SIAM J. Control Optim. 17 (1979) 99-122
17. Gal S. Search Games (1980), Academic Press, New York
18. Gal S. On the optimality of a simple strategy for searching graphs. Int. J. Game Theory 29 (2001) 533-542
19. Hierholzer C., and Möglichkeit U.d. einen Linienzug ohne Wiederholung und ohne Unterbrechung zu umfahren. Mathematische Annalen VI (1873) 30-32
20. A. Jotshi, Search for immobile friendly entities on a network, Unpublished Doctoral Dissertation, Department of Industrial & Systems Engineering, University at Buffalo (SUNY), Buffalo, NY-14120, USA, 2006.
21. A. Jotshi, Q. Gong, R. Batta, Dispatching and routing of emergency vehicles in disaster mitigation using data fusion, Socio-Economic Planning Sciences, accepted for publication.
22. Kikuta K. A search game on a cyclic graph. Naval. Res. Logist. 51 (2004) 1-17
23. Kruskal J.B. On the shortest spanning subtree and the traveling salesman problem. Proc. Am. Math. Soc. 7 (1956) 48-50
24. LEDA, Library for efficient data types and algorithms, webpage http://www.algorithmic-solutions.com/enleda.htm.
25. Reijnierse J., and Potters J. Search games with immobile hider. Int. J. Game Theory 21 (1993) 385-394
26. Stengel B.V., and Werchner R. Complexity of searching an immobile hider in a graph. Discr. Appl. Math. 78 (1997) 235-249
27. Stone L. Theory of optimal search. 2nd Ed. (1989), Operations Research Society of America, Arlington, Virginia