{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T13:41:09Z","timestamp":1768398069558,"version":"3.49.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,1,11]],"date-time":"2008-01-11T00:00:00Z","timestamp":1200009600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s00186-007-0197-2","type":"journal-article","created":{"date-parts":[[2008,1,10]],"date-time":"2008-01-10T10:40:07Z","timestamp":1199961607000},"page":"539-549","source":"Crossref","is-referenced-by-count":34,"title":["Optimal discrete search with imperfect specificity"],"prefix":"10.1007","volume":"68","author":[{"given":"Moshe","family":"Kress","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyle Y.","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Szechtman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,1,11]]},"reference":[{"key":"197_CR1","volume-title":"Search problems","author":"R Ahlswede","year":"1987","unstructured":"Ahlswede R, Wegener I (1987) Search problems. Wiley, New York"},{"key":"197_CR2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0019-9958(65)90052-5","volume":"8","author":"WL Black","year":"2004","unstructured":"Black WL (2004) Discrete sequential search. Inf Control 8: 159\u2013162","journal-title":"Inf Control"},{"key":"197_CR3","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1214\/aoms\/1177698965","volume":"38","author":"MC Chew","year":"1967","unstructured":"Chew MC (1967) A sequential search procedure. Ann Math Stat 38: 494\u2013502","journal-title":"Ann Math Stat"},{"issue":"3","key":"197_CR4","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1287\/opre.21.3.741","volume":"21","author":"MC Chew","year":"1973","unstructured":"Chew MC (1973) Optimal stopping in a discrete search problem. Oper Res 21(3): 741\u2013747","journal-title":"Oper Res"},{"issue":"3","key":"197_CR5","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1287\/opre.10.3.285","volume":"10","author":"JM Danskin","year":"1962","unstructured":"Danskin JM (1962) A theory of reconnaissance: I, ii. Oper Res 10(3): 285\u2013309","journal-title":"Oper Res"},{"key":"197_CR6","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1287\/opre.19.4.894","volume":"19","author":"JB Kadane","year":"1971","unstructured":"Kadane JB (1971) Optimal whereabout search. Oper Res 19: 894\u2013904","journal-title":"Oper Res"},{"key":"197_CR7","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1080\/00029890.1964.11992194","volume":"71","author":"D Matula","year":"1964","unstructured":"Matula D (1964) A periodic optimal search. Amer Math Mon 71: 15\u201321","journal-title":"Amer Math Mon"},{"key":"197_CR8","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1287\/opre.19.3.559","volume":"19","author":"SM Pollock","year":"1971","unstructured":"Pollock SM (1971) Serch detection and subsequent action: some problems on the interfaces. Oper Res 19: 559\u2013586","journal-title":"Oper Res"},{"key":"197_CR9","volume-title":"Introduction to stochastic dynamic programming","author":"SM Ross","year":"1983","unstructured":"Ross SM (1983) Introduction to stochastic dynamic programming. Academic Press, Amsterdam"},{"key":"197_CR10","first-page":"1","volume":"60","author":"N-O Song","year":"2004","unstructured":"Song N-O, Teneketzis D (2004) Discrete search with multiple sensors. Math Meth Oper Res 60: 1\u201313","journal-title":"Math Meth Oper Res"},{"key":"197_CR11","volume-title":"Theory of optimal search","author":"LD Stone","year":"1975","unstructured":"Stone LD (1975) Theory of optimal search. Academic Press, Amsterdam"},{"key":"197_CR12","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1287\/moor.5.3.373","volume":"5","author":"I Wegener","year":"1980","unstructured":"Wegener I (1980) The discrete sequential search problem with nonrandom cost and overlook probabilities. Math Oper Res 5: 373\u2013380","journal-title":"Math Oper Res"},{"key":"197_CR13","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0020-0190(85)90108-5","volume":"21","author":"I Wegener","year":"1980","unstructured":"Wegener I (1980) Optimal search with positive switch cost is np-hard. Inf Process Lett 21: 49\u201352","journal-title":"Inf Process Lett"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-007-0197-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-007-0197-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-007-0197-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T14:33:26Z","timestamp":1558622006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-007-0197-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,11]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["197"],"URL":"https:\/\/doi.org\/10.1007\/s00186-007-0197-2","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1,11]]}}}