{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:02:43Z","timestamp":1743004963576,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319448312"},{"type":"electronic","value":"9783319448329"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44832-9_8","type":"book-chapter","created":{"date-parts":[[2016,8,9]],"date-time":"2016-08-09T10:24:12Z","timestamp":1470738252000},"page":"131-148","source":"Crossref","is-referenced-by-count":1,"title":["Heuristics on the Data-Collecting Robot Problem with Immediate Rewards"],"prefix":"10.1007","author":[{"given":"Zhi","family":"Xing","sequence":"first","affiliation":[]},{"given":"Jae C.","family":"Oh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,10]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1057\/palgrave.jors.2602603","volume":"60","author":"C Archetti","year":"2009","unstructured":"Archetti, C., Feillet, D., Hertz, A., Grazia Speranza, M.: The capacitated team orienteering and profitable tour problems. J. Oper. Res. Soc. 60, 831\u2013842 (2009)","journal-title":"J. Oper. Res. Soc."},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, B., Raghavan, P., Sudan, M.: The minimum latency problem. In: Proceedings of the 26th Symposium on Theory of Computing, STOC, p. 9 (1994)","DOI":"10.1145\/195058.195125"},{"issue":"2","key":"8_CR3","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1137\/050645464","volume":"37","author":"A Blum","year":"2007","unstructured":"Blum, A., Chawla, S., Karger, D.R., Lane, T., Meyerson, A., Minkoff, M.: Approximation algorithms for orienteering and discounted-reward TSP. SIAM J. Comput. 37(2), 653\u2013670 (2007)","journal-title":"SIAM J. Comput."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Chaudhuri, K., Godfrey, B., Rao, S., Talwar, K.: Paths, trees, and minimum latency tours. In: Proceedings - 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS, pp. 36\u201345. IEEE (2003)","DOI":"10.1109\/SFCS.2003.1238179"},{"issue":"4","key":"8_CR5","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1109\/TRO.2009.2022423","volume":"25","author":"HL Choi","year":"2009","unstructured":"Choi, H.L., Brunet, L., How, J.P.: Consensus-based decentralized auctions for robust task allocation. IEEE Trans. Robot. 25(4), 912\u2013926 (2009)","journal-title":"IEEE Trans. Robot."},{"issue":"4","key":"8_CR6","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1016\/j.cie.2013.01.010","volume":"64","author":"A Ekici","year":"2013","unstructured":"Ekici, A., Retharekar, A.: Multiple agents maximum collection problem with time dependent rewards. Comput. Ind. Eng. 64(4), 1009\u20131018 (2013)","journal-title":"Comput. Ind. Eng."},{"key":"8_CR7","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/trsc.1030.0079","volume":"39","author":"D Feillet","year":"2001","unstructured":"Feillet, D., Dejax, P., Gendreau, M.: Traveling salesman problems with profits: an overview. Transp. Sci. 39, 188\u2013205 (2001)","journal-title":"Transp. Sci."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Hudack, J., Oh, J.: Multi-agent sensor data collection with attrition risk. In: Proceedings - The 26th International Conference on Automated Planning and Scheduling, ICAPS (2016)","DOI":"10.1609\/icaps.v26i1.13736"},{"key":"8_CR9","unstructured":"Moshref-Javadi, M., Lee, S.: A taxonomy to the class of minimum latency problems. In: Proceedings - IIE Annual Conference, pp. 3896. Institute of Industrial Engineers-Publisher (2013)"},{"key":"8_CR10","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/978-1-4020-9688-4_3","volume-title":"Fundamental Problems in Computing: Essays in Honor of Professor Daniel J. Rosenkrantz","author":"DJ Rosenkrantz","year":"2009","unstructured":"Rosenkrantz, D.J., Stearns, R.E., Lewis, P.M.: An analysis of several heuristics for the traveling salesman problem. In: Ravi, S.S., Shukla, S.K. (eds.) Fundamental Problems in Computing: Essays in Honor of Professor Daniel J. Rosenkrantz, pp. 45\u201369. Springer Science & Business Media, Dordrecht (2009)"},{"issue":"2","key":"8_CR11","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/j.ejor.2015.01.040","volume":"244","author":"L Talarico","year":"2015","unstructured":"Talarico, L., S\u00f6rensen, K., Springael, J.: Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem. Eur. J. Oper. Res. 244(2), 457\u2013470 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR12","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611973594","volume-title":"Vehicle Routing: Problems, Methods, and Applications","author":"P Toth","year":"2014","unstructured":"Toth, P., Vigo, D.: Vehicle Routing: Problems, Methods, and Applications, vol. 18. Society for Industrial and Applied Mathematics, Philadelphia (2014)"}],"container-title":["Lecture Notes in Computer Science","PRIMA 2016: Princiles and Practice of Multi-Agent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44832-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T15:45:51Z","timestamp":1692459951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44832-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319448312","9783319448329"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44832-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}