{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:53:55Z","timestamp":1778496835924,"version":"3.51.4"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T00:00:00Z","timestamp":1564358400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T00:00:00Z","timestamp":1564358400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s10589-019-00121-w","type":"journal-article","created":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T19:02:12Z","timestamp":1564426932000},"page":"517-545","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Minimizing the average searching time for an object within a graph"],"prefix":"10.1007","volume":"74","author":[{"given":"Ron","family":"Teller","sequence":"first","affiliation":[]},{"given":"Moshe","family":"Zofi","sequence":"additional","affiliation":[]},{"given":"Moshe","family":"Kaspi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,29]]},"reference":[{"issue":"4","key":"121_CR1","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1002\/1520-6750(199108)38:4<469::AID-NAV3220380404>3.0.CO;2-E","volume":"38","author":"SJ Benkoski","year":"1991","unstructured":"Benkoski, S.J., Monticino, M.G., Weisinger, J.R.: A survey of the search theory literature. Naval Res. Logist. 38(4), 469\u2013494 (1991)","journal-title":"Naval Res. Logist."},{"key":"121_CR2","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BF02759737","volume":"2","author":"A Beck","year":"1964","unstructured":"Beck, A.: On the linear search problem. Isr. J. Math. 2, 221\u2013228 (1964)","journal-title":"Isr. J. Math."},{"key":"121_CR3","volume-title":"Differential Games: A Mathematical Theory With Applications to Warfare and Pursuit, Control and Optimization","author":"R Isaacs","year":"1999","unstructured":"Isaacs, R.: Differential Games: A Mathematical Theory With Applications to Warfare and Pursuit, Control and Optimization. Courier Dover Publications, Mineola (1999)"},{"issue":"3","key":"121_CR4","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1137\/S0363012993249195","volume":"33","author":"S Alpern","year":"1995","unstructured":"Alpern, S.: The rendezvous search problem. SIAM J. Control Optim. 33(3), 673\u2013683 (1995)","journal-title":"SIAM J. Control Optim."},{"key":"121_CR5","volume-title":"Theory of Optimal Search","author":"LD Stone","year":"1975","unstructured":"Stone, L.D.: Theory of Optimal Search, 2nd edn. Academic Press, New York (1975)","edition":"2"},{"issue":"6","key":"121_CR6","doi-asserted-by":"publisher","first-page":"1275","DOI":"10.1287\/opre.28.6.1275","volume":"28","author":"SS Brown","year":"1980","unstructured":"Brown, S.S.: Optimal search for a moving target in discrete time and space. Oper. Res. 28(6), 1275\u20131289 (1980)","journal-title":"Oper. Res."},{"key":"121_CR7","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0305-0548(79)90025-X","volume":"6","author":"TJ Stewart","year":"1979","unstructured":"Stewart, T.J.: Search for a moving target when search motion is restricted. Comput. Oper. Res. 6, 129\u2013140 (1979)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"121_CR8","doi-asserted-by":"publisher","first-page":"708","DOI":"10.2307\/3214009","volume":"23","author":"RR Weber","year":"1986","unstructured":"Weber, R.R.: Optimal search for a randomly moving object. J. Appl. Probab. 23(3), 708\u2013717 (1986)","journal-title":"J. Appl. Probab."},{"key":"121_CR9","unstructured":"Morin, M. Abi-Zeid, I. Lang, P. Lamontagne, L., Maupin, P.: The optimal searcher path problem with a visibility criterion in discrete time and space. In: 12th International Conference on Information Fusion, 2009. FUSION\u201909, pp. 2217\u20132224. IEEE (2009)"},{"issue":"5","key":"121_CR10","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1002\/nav.20411","volume":"57","author":"H Sato","year":"2010","unstructured":"Sato, H., Royset, J.O.: Path optimization for the resource-constrained searcher. Naval Res. Logist. 57(5), 422\u2013440 (2010)","journal-title":"Naval Res. Logist."},{"issue":"2","key":"121_CR11","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. Eur. J. Oper. Res. 190(2), 383\u2013397 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"121_CR12","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.ejor.2007.08.032","volume":"191","author":"A Jotshi","year":"2008","unstructured":"Jotshi, A., Batta, R.: Search for an immobile entity on a network. Eur. J. Oper. Res. 191(2), 347\u2013359 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"121_CR13","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1504\/IJMOR.2009.022875","volume":"1","author":"A Jotshi","year":"2009","unstructured":"Jotshi, A., Batta, R.: Investigating the benefits of re-optimisation while searching for two immobile entities on a network. Int. J. Math. Oper. Res. 1(1), 37\u201375 (2009)","journal-title":"Int. J. Math. Oper. Res."},{"key":"121_CR14","doi-asserted-by":"publisher","first-page":"1562","DOI":"10.1016\/j.cor.2011.01.015","volume":"38","author":"O Berman","year":"2011","unstructured":"Berman, O., Lanovsky, E., Krass, D.: Optimal search path for service in the presence of disruptions. Comput. Oper. Res. 38, 1562\u20131571 (2011)","journal-title":"Comput. Oper. Res."},{"issue":"1\u20133","key":"121_CR15","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.dam.2002.08.001","volume":"142","author":"T \u00dcnl\u00fcyurt","year":"2004","unstructured":"\u00dcnl\u00fcyurt, T.: Sequential testing of complex systems: a review. Discrete Appl. Math. 142(1\u20133), 189\u2013205 (2004)","journal-title":"Discrete Appl. Math."},{"key":"121_CR16","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.cor.2018.01.016","volume":"93","author":"T Bulh\u00f5es","year":"2018","unstructured":"Bulh\u00f5es, T., Sadykov, R., Uchoa, E.: A branch-and-price algorithm for the minimum latency problem. Comput. Oper. Res. 93, 66\u201378 (2018)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"121_CR17","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1051\/ita\/1986200100791","volume":"20","author":"F Afrati","year":"1986","unstructured":"Afrati, F., Cosmadakis, S., Papadimitriou, C.H., Papageorgiou, G., Papakostantinou, N.: The complexity of the travelling repairman problem. RAIRO Theor. Inform. Appl. 20(1), 79\u201387 (1986)","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"121_CR18","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"CH Papadimitriou","year":"1982","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Upper Saddle River (1982)"},{"issue":"3","key":"121_CR19","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni, S., Gonzalez, T.: P-complete approximation problems. J. Assoc. Comput. Mach. 23(3), 555\u2013565 (1976)","journal-title":"J. Assoc. Comput. Mach."},{"key":"121_CR20","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1137\/0206041","volume":"6","author":"DJ Rosenkrantz","year":"1977","unstructured":"Rosenkrantz, D.J., Stearns, R.E., Lewis II, P.M.: An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6, 563\u2013581 (1977)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"121_CR21","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evolut. Comput. 1(1), 53\u201366 (1997)","journal-title":"IEEE Trans. Evolut. Comput."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00121-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00121-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00121-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,21]],"date-time":"2024-07-21T13:20:20Z","timestamp":1721568020000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00121-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,29]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["121"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00121-w","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,29]]},"assertion":[{"value":"31 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}