{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T01:05:15Z","timestamp":1770599115591,"version":"3.49.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s10287-013-0179-1","type":"journal-article","created":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T23:27:19Z","timestamp":1374103639000},"page":"459-473","source":"Crossref","is-referenced-by-count":11,"title":["An orienteering model for the search and rescue problem"],"prefix":"10.1007","volume":"11","author":[{"given":"Adel","family":"Guitouni","sequence":"first","affiliation":[]},{"given":"Hatem","family":"Masri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,7,19]]},"reference":[{"issue":"3","key":"179_CR1","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1016\/j.ejor.2003.10.029","volume":"162","author":"I Abi-Zeid","year":"2005","unstructured":"Abi-Zeid I, Frost JR (2005) SARPlan: a decision support system for Canadian search and rescue operations. Eur J Oper Res 162(3):630\u2013653","journal-title":"Eur J Oper Res"},{"issue":"2","key":"179_CR2","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1002\/nav.10009","volume":"49","author":"F Dambreville","year":"2002","unstructured":"Dambreville F, Le Cadre JP (2002) Detection of a Markovian-target with optimization of the search efforts under generalized linear constraints. Naval Res Logist 49(2):117\u2013142","journal-title":"Naval Res Logist"},{"issue":"4","key":"179_CR3","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1002\/(SICI)1520-6750(199606)43:4<463::AID-NAV1>3.0.CO;2-5","volume":"43","author":"RF Dell","year":"1996","unstructured":"Dell RF, Eagle JN, Alves Martins GH, Garnier Santos A (1996) Using multiple searchers in constrained-path moving target search problem. Naval Res Logist 43(4):463\u2013480","journal-title":"Naval Res Logist"},{"issue":"1","key":"179_CR4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0167-6377(91)90083-2","volume":"10","author":"M Desrochers","year":"1991","unstructured":"Desrochers M, Laporte G (1991) Improvements and extensions to the Miller\u2013Tucker\u2013Zemlin subtour elimination constraints. Oper Res Lett 10(1):27\u201336","journal-title":"Oper Res Lett"},{"key":"179_CR5","unstructured":"Dor\u00e9 PE, Martin A, Abi-Zeid I, Maupin P, Jousselme AL (2009) Theory of belief functions for information combination and update in search and rescue operations. In: The proceedings of the 12th international conference on information fusion Seattle, Washington, pp 514\u2013521"},{"issue":"5","key":"179_CR6","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1287\/opre.32.5.1107","volume":"32","author":"JN Eagle","year":"1984","unstructured":"Eagle JN (1984) The optimal search for a moving target when the search path is constrained. Oper Res 32(5):1107\u20131115","journal-title":"Oper Res"},{"issue":"1","key":"179_CR7","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1287\/opre.38.1.110","volume":"38","author":"JN Eagle","year":"1990","unstructured":"Eagle JN, Yee JR (1990) An Optimal Branch, an optimal branch bound procedure for the constrained path moving target search problem. Oper Res 38(1):110\u2013114","journal-title":"Oper Res"},{"key":"179_CR8","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1002\/net.21496","volume":"61","author":"G Erdogan","year":"2013","unstructured":"Erdogan G, Laporte G (2013) The orienteering problem with variable profits. Networks 61:104\u2013116","journal-title":"Networks"},{"key":"179_CR9","unstructured":"Frost J (1998) The theory of search: a simplified explanation. Report by Soza & Company Ltd and Office of Search and Rescue US Coast Guard"},{"issue":"1","key":"179_CR10","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/S0377-2217(96)00167-1","volume":"100","author":"R Hohzaki","year":"1997","unstructured":"Hohzaki R, Iida K (1997) Optimal strategy of route and look for the path constrained search problem with reward criterion. Eur J Oper Res 100(1):236\u2013249","journal-title":"Eur J Oper Res"},{"issue":"2","key":"179_CR11","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/j.ejor.2007.10.048","volume":"193","author":"SP Hong","year":"2009","unstructured":"Hong SP, Cho SJ, Park MJ (2009) A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search. Eur J Oper Res 193(2):351\u2013364","journal-title":"Eur J Oper Res"},{"key":"179_CR12","unstructured":"IAMSAR (1999) International Aeronautical and Maritime Search And Rescue Manual. ICAO\/IMO publications"},{"issue":"9\u201310","key":"179_CR13","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1016\/j.mcm.2005.05.025","volume":"43","author":"SH Jacobson","year":"2006","unstructured":"Jacobson SH, McLay LA (2006) Optimal search strategies using simultaneous generalized hill climbing algorithms. Math Comput Model 43(9\u201310):1061\u20131073","journal-title":"Math Comput Model"},{"issue":"4","key":"179_CR14","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/j.ast.2006.12.005","volume":"11","author":"F Janez","year":"2007","unstructured":"Janez F (2007) Optimization method for sensor planning. Aerosp Sci Technol 11(4):310\u2013316","journal-title":"Aerosp Sci Technol"},{"key":"179_CR15","doi-asserted-by":"crossref","unstructured":"Kao D, Dungan J, Pang A (2001) Visualizing 2D probability distributions from EOS satellite image-derived data sets: a case study. In: Proceedings of the conference on visualization \u201901 San Diego. California San Diego, USA, pp 457\u2013460","DOI":"10.1109\/VISUAL.2001.964550"},{"issue":"3","key":"179_CR16","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1016\/S0377-2217(03)00377-1","volume":"158","author":"I Kara","year":"2004","unstructured":"Kara I, Laporte G, Tolga B (2004) A note on the lifted Miller\u2013Tucker\u2013Zemlin subtour elimination constraints for the capacitated vehicle routing problem. Eur J Oper Res 158(3):793\u2013795","journal-title":"Eur J Oper Res"},{"issue":"2","key":"179_CR17","doi-asserted-by":"crossref","first-page":"45","DOI":"10.5711\/morj.8.2.45","volume":"8","author":"DP Kierstead","year":"2003","unstructured":"Kierstead DP, Del Balzo DR (2003) A genetic algorithm applied to planning search paths in complicated environments. Mil Oper Res 8(2):45\u201359","journal-title":"Mil Oper Res"},{"key":"179_CR18","volume-title":"Search and screening: general principles with historical applications","author":"BO Koopman","year":"1980","unstructured":"Koopman BO (1980) Search and screening: general principles with historical applications. Pergamon Press, NY"},{"issue":"4","key":"179_CR19","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"C Miller","year":"1960","unstructured":"Miller C, Tucker A, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J ACM 7(4):326\u2013329","journal-title":"J ACM"},{"issue":"4","key":"179_CR20","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1287\/opre.50.4.656.2865","volume":"50","author":"HD Sherali","year":"2002","unstructured":"Sherali HD, Driscoll PJ (2002) On tightening the relaxations of Miller\u2013Tucker\u2013Zemlin formulations for asymmetric traveling salesman problem. Oper Res 50(4):656\u2013669","journal-title":"Oper Res"},{"issue":"3","key":"179_CR21","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0305-0548(79)90025-X","volume":"6","author":"TJ Stewart","year":"1979","unstructured":"Stewart TJ (1979) Search for a moving target when searcher motion is restricted. Comput Oper Res 6(3): 129\u2013140","journal-title":"Comput Oper Res"},{"key":"179_CR22","volume-title":"Theory of optimal search","author":"LD Stone","year":"1975","unstructured":"Stone LD (1975) Theory of optimal search. Academic Press, London"},{"issue":"2","key":"179_CR23","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1287\/opre.34.2.324","volume":"34","author":"JR Trummel","year":"1986","unstructured":"Trummel JR, Weisinger JR (1986) The complexity of the optimal searcher path problem. Oper Res 34(2):324\u2013327","journal-title":"Oper Res"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-013-0179-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10287-013-0179-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-013-0179-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,18]],"date-time":"2019-07-18T14:10:56Z","timestamp":1563459056000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10287-013-0179-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,19]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["179"],"URL":"https:\/\/doi.org\/10.1007\/s10287-013-0179-1","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,19]]}}}