{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:12Z","timestamp":1759638612391,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319232188"},{"type":"electronic","value":"9783319232195"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23219-5_29","type":"book-chapter","created":{"date-parts":[[2015,8,12]],"date-time":"2015-08-12T10:17:33Z","timestamp":1439374653000},"page":"403-418","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Bounding an Optimal Search Path with a Game of Cop and Robber on Graphs"],"prefix":"10.1007","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Simard","sequence":"first","affiliation":[]},{"given":"Michael","family":"Morin","sequence":"additional","affiliation":[]},{"given":"Claude-Guy","family":"Quimper","sequence":"additional","affiliation":[]},{"given":"Fran\u00e7ois","family":"Laviolette","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9e","family":"Desharnais","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,13]]},"reference":[{"issue":"2","key":"29_CR1","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1287\/opre.34.2.324","volume":"34","author":"K Trummel","year":"1986","unstructured":"Trummel, K., Weisinger, J.: The complexity of the optimal searcher path problem. Operations Research 34(2), 324\u2013327 (1986)","journal-title":"Operations Research"},{"issue":"3","key":"29_CR2","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0305-0548(79)90025-X","volume":"6","author":"T Stewart","year":"1979","unstructured":"Stewart, T.: Search for a moving target when the searcher motion is restricted. Computers and Operations Research 6(3), 129\u2013140 (1979)","journal-title":"Computers and Operations Research"},{"key":"29_CR3","volume-title":"Theory of Optimal Search","author":"L Stone","year":"2004","unstructured":"Stone, L.: Theory of Optimal Search. Academic Press, New York (2004)"},{"key":"29_CR4","unstructured":"Netsch, R.: The USCG search and rescue optimal planning system (SAROPS) via the commercial\/joint mapping tool kit (c\/jmtk). In: Proceedings of the 24th Annual ESRI User Conference, vol. 9, August 2004"},{"issue":"3","key":"29_CR5","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1016\/j.ejor.2003.10.029","volume":"162","author":"I Abi-Zeid","year":"2005","unstructured":"Abi-Zeid, I., Frost, J.: A decision support system for canadian search and rescue operations. European Journal of Operational Research 162(3), 636\u2013653 (2005)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"29_CR6","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1002\/(SICI)1520-6750(199804)45:3<243::AID-NAV1>3.0.CO;2-7","volume":"45","author":"AR Washburn","year":"1998","unstructured":"Washburn, A.R.: Branch and bound methods for a search problem. Naval Research Logistics 45(3), 243\u2013257 (1998)","journal-title":"Naval Research Logistics"},{"issue":"2","key":"29_CR7","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.ejor.2007.06.043","volume":"190","author":"H Lau","year":"2008","unstructured":"Lau, H., Huang, S., Dissanayake, G.: Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times. European Journal of Operational Research 190(2), 383\u2013397 (2008)","journal-title":"European Journal of Operational Research"},{"key":"29_CR8","unstructured":"Morin, M., Lamontagne, L., Abi-Zeid, I., Lang, P., Maupin, P.: The optimal searcher path problem with a visibility criterion in discrete time and space. In: Proceedings of the 12th International Conference on Information Fusion, pp. 2217\u20132224 (2009)"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Sato, H., Royset, J.O.: Path optimization for the resource-constrained searcher. Naval Research Logistics, 422\u2013440 (2010)","DOI":"10.1002\/nav.20411"},{"key":"29_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"988","DOI":"10.1007\/978-3-642-33558-7_70","volume-title":"Principles and Practice of Constraint Programming","author":"M Morin","year":"2012","unstructured":"Morin, M., Papillon, A.-P., Abi-Zeid, I., Laviolette, F., Quimper, C.-G.: Constraint programming for path planning with uncertainty. In: Milano, M. (ed.) CP 2012. LNCS, vol. 7514, pp. 988\u20131003. Springer, Heidelberg (2012)"},{"issue":"2","key":"29_CR11","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0012-365X(83)90160-7","volume":"43","author":"R Nowakowski","year":"1983","unstructured":"Nowakowski, R., Winkler, P.: Vertex-to-vertex pursuit in a graph. Discrete Mathematics 43(2), 235\u2013239 (1983)","journal-title":"Discrete Mathematics"},{"key":"29_CR12","unstructured":"Quilliot, A.: Probl\u00e8me de jeux, de point fixe, de connectivit\u00e9 et de repr\u00e9sentation sur des graphes, des ensembles ordonn\u00e9s et des hypergraphes. Ph.D thesis, Universit\u00e9 de Paris VI (1983)"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Bonato, A., Nowakowski, R.: The game of cops and robbers on graphs. American Mathematical Soc. (2011)","DOI":"10.1090\/stml\/061"},{"issue":"3","key":"29_CR14","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.tcs.2008.02.040","volume":"399","author":"FV Fomin","year":"2008","unstructured":"Fomin, F.V., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. Theoretical Computer Science 399(3), 236\u2013245 (2008)","journal-title":"Theoretical Computer Science"},{"key":"29_CR15","unstructured":"Beldiceanu, N., Demassey, S.: Global constraint catalog (2014). http:\/\/sofdem.github.io\/gccat\/ (accessed 2015\u201304)"},{"key":"29_CR16","unstructured":"Martins, G.H.: A new branch-and-bound procedure for computing optimal search paths. Master\u2019s thesis, Naval Postgraduate School (1993)"},{"key":"29_CR17","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.tcs.2013.01.032","volume":"481","author":"A Kehagias","year":"2013","unstructured":"Kehagias, A., Mitsche, D., Pra\u0142at, P.: Cops and invisible robbers: The cost of drunkenness. Theoretical Computer Science 481, 100\u2013120 (2013)","journal-title":"Theoretical Computer Science"},{"key":"29_CR18","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.tcs.2012.08.016","volume":"463","author":"A Kehagias","year":"2012","unstructured":"Kehagias, A., Pra\u0142at, P.: Some remarks on cops and drunk robbers. Theoretical Computer Science 463, 133\u2013147 (2012)","journal-title":"Theoretical Computer Science"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"Komarov, N., Winkler, P.: Capturing the Drunk Robber on a Graph. arXiv preprint arXiv:1305.4559 (2013)","DOI":"10.37236\/3398"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"B\u00e4uerle, N., Rieder, U.: Markov Decision Processes with Applications to Finance. Springer (2011)","DOI":"10.1007\/978-3-642-18324-9"},{"key":"29_CR21","unstructured":"Puterman, M.L.: Markov decision processes: discrete stochastic dynamic programming, vol. 414. John Wiley & Sons (2009)"},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"Barto, A.G., Sutton, R.S.: Reinforcement learning: An introduction. MIT press (1998)","DOI":"10.1016\/S1474-6670(17)38315-5"},{"key":"29_CR23","unstructured":"Laburthe, F., Jussien, N.: Choco solver documentation. \u00c9cole de Mines de Nantes (2012)"},{"key":"29_CR24","unstructured":"O\u2019Madadhain, J., Fisher, D., Nelson, T., White, S., Boey, Y.B.: The JUNG (Java universal network\/graph) framework (2010)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23219-5_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T23:42:59Z","timestamp":1676677379000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23219-5_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319232188","9783319232195"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23219-5_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"13 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}