{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:32:36Z","timestamp":1743021156469,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319644707"},{"type":"electronic","value":"9783319644714"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-64471-4_29","type":"book-chapter","created":{"date-parts":[[2017,8,1]],"date-time":"2017-08-01T10:37:25Z","timestamp":1501583845000},"page":"363-377","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Itinerary Planning with Category Constraints Using a Probabilistic Approach"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Bolzoni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Persia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Helmer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,2]]},"reference":[{"issue":"2","key":"29_CR1","doi-asserted-by":"publisher","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":"29_CR2","doi-asserted-by":"crossref","unstructured":"Bolzoni, P., Helmer, S., Wellenzohn, K., Gamper, J., Andritsos, P.: Efficient itinerary planning with category constraints. In: Proceedings of the 22nd International Conference on Advances in Geographic Information Systems (SIGSPATIAL 2014), Dallas, Texas, pp. 203\u2013212 (2014)","DOI":"10.1145\/2666310.2666411"},{"key":"29_CR3","unstructured":"Chekuri, C., Korula, N., P\u00e1l, M.: Improved algorithms for orienteering and related problems. In: SODA 2008, pp. 661\u2013670 (2008)"},{"key":"29_CR4","unstructured":"Chekuri, C., P\u00e1l, M.: A recursive greedy algorithm for walks in directed graphs. In: FOCS 2005, pp. 245\u2013253 (2005)"},{"issue":"3","key":"29_CR5","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s10732-014-9242-5","volume":"20","author":"D Gavalas","year":"2014","unstructured":"Gavalas, D., Konstantopoulos, C., Mastakas, K., Pantziou, G.: A survey on algorithmic approaches for solving tourist trip design problems. J. Heuristics 20(3), 291\u2013328 (2014)","journal-title":"J. Heuristics"},{"issue":"4","key":"29_CR6","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1002\/(SICI)1097-0037(199812)32:4<263::AID-NET3>3.0.CO;2-Q","volume":"32","author":"M Gendreau","year":"1998","unstructured":"Gendreau, M., Laporte, G., Semet, F.: A branch-and-cut algorithm for the undirected selective traveling salesman problem. Networks 32(4), 263\u2013273 (1998)","journal-title":"Networks"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Kanza, Y., Safra, E., Sagiv, Y., Doytsher, Y.: Heuristic algorithms for route-search queries over geographical data. In: ACM GIS 2008, pp. 11:1\u201311:10 (2008)","DOI":"10.1145\/1463434.1463449"},{"key":"29_CR8","first-page":"224","volume":"41","author":"C Keller","year":"1989","unstructured":"Keller, C.: Algorithms to solve the orienteering problem: a comparison. Eur. J. OR 41, 224\u2013231 (1989)","journal-title":"Eur. J. OR"},{"key":"29_CR9","unstructured":"Liang, Y.-C., Kulturel-Konak, S., Smith, A.: Meta heuristics for the orienteering problem. In: CEC 2002, pp. 384\u2013389 (2002)"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Lu, E.H.-C., Lin, C.-Y., Tseng, V.S.: Trip-mine: an efficient trip planning approach with travel time constraints. In: MDM 2011, pp. 152\u2013161 (2011)","DOI":"10.1109\/MDM.2011.13"},{"issue":"2","key":"29_CR11","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1287\/ijoc.4.2.155","volume":"4","author":"R Ramesh","year":"1992","unstructured":"Ramesh, R., Yoon, Y.-S., Karwan, M.H.: An optimal algorithm for the orienteering tour problem. INFORMS J. Comput. 4(2), 155\u2013165 (1992)","journal-title":"INFORMS J. Comput."},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Rice, M.N., Tsotras, V.J.: Parameterized algorithms for generalized traveling salesman problems in road networks. In: ACM GIS 2013, Orlando, Florida, pp. 114\u2013123 (2013)","DOI":"10.1145\/2525314.2525342"},{"issue":"4","key":"29_CR13","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1016\/j.cor.2008.01.003","volume":"36","author":"G Righini","year":"2009","unstructured":"Righini, G., Salani, M.: Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming. Comput. OR 36(4), 1191\u20131203 (2009)","journal-title":"Comput. OR"},{"key":"29_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/11902140_16","volume-title":"Computer and Information Sciences \u2013 ISCIS 2006","author":"Z Sevkli","year":"2006","unstructured":"Sevkli, Z., Sevilgen, F.E.: Variable neighborhood search for the orienteering problem. In: Levi, A., Sava\u015f, E., Yenig\u00fcn, H., Balc\u0131soy, S., Sayg\u0131n, Y. (eds.) ISCIS 2006. LNCS, vol. 4263, pp. 134\u2013143. Springer, Heidelberg (2006). doi:10.1007\/11902140_16"},{"key":"29_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-30866-1","volume-title":"Applied Computer Science","author":"T Shane","year":"2016","unstructured":"Shane, T.: Applied Computer Science. Springer, Cham (2016). doi:10.1007\/978-3-319-30866-1"},{"key":"29_CR16","unstructured":"Singh, A., Krause, A., Guestrin, C., Kaiser, W.J., Batalin, M.A.: Efficient planning of informative paths for multiple robots. In: IJCAI 2007, pp. 2204\u20132211 (2007)"},{"key":"29_CR17","unstructured":"Tasgetiren, F., Smith, A.: A genetic algorithm for the orienteering problem. In: IEEE Congress on Evolutionary Computation (2000)"},{"issue":"9","key":"29_CR18","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1057\/jors.1984.162","volume":"35","author":"TA Tsiligrides","year":"1984","unstructured":"Tsiligrides, T.A.: Heuristic methods applied to orienteering. J. Oper. Res. Soc. 35(9), 797\u2013809 (1984)","journal-title":"J. Oper. Res. Soc."},{"key":"29_CR19","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF02098284","volume":"61","author":"Q Wang","year":"1995","unstructured":"Wang, Q., Sun, X., Golden, B.L., Jia, J.: Using artificial neural networks to solve the orienteering problem. Ann. OR 61, 111\u2013120 (1995)","journal-title":"Ann. OR"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-64471-4_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T20:13:30Z","timestamp":1710360810000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-64471-4_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319644707","9783319644714"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-64471-4_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"2 August 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lyon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/dexa2017","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}