{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T14:55:42Z","timestamp":1776696942383,"version":"3.51.2"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2012,9,28]],"date-time":"2012-09-28T00:00:00Z","timestamp":1348790400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s11590-012-0559-4","type":"journal-article","created":{"date-parts":[[2012,9,28]],"date-time":"2012-09-28T00:09:50Z","timestamp":1348790990000},"page":"1405-1417","source":"Crossref","is-referenced-by-count":20,"title":["The capacitated team orienteering problem with incomplete service"],"prefix":"10.1007","volume":"7","author":[{"given":"Claudia","family":"Archetti","sequence":"first","affiliation":[]},{"given":"Nicola","family":"Bianchessi","sequence":"additional","affiliation":[]},{"given":"M. Grazia","family":"Speranza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,9,28]]},"reference":[{"key":"559_CR1","doi-asserted-by":"crossref","unstructured":"Archetti, C., Bianchessi, N., Speranza, M.G.: Optimal solutions for routing problems with profits. Discret. Appl. Math. (2012). doi: 10.1016\/j.dam.2011.12.021","DOI":"10.1016\/j.dam.2011.12.021"},{"key":"559_CR2","unstructured":"Archetti, C., Bianchessi, N., Hertz, A., Speranza, M.G.: Incomplete service and split deliveries in a routing problem with profits. Networks (to appear)"},{"key":"559_CR3","unstructured":"Archetti, C., Bianchessi, N., Hertz, A., Speranza, M.G.: The split delivery capacitated team orienteering problem. Networks (to appear)"},{"key":"559_CR4","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10732-006-9004-0","volume":"13","author":"C Archetti","year":"2007","unstructured":"Archetti, C., Hertz, A., Speranza, M.G.: Metaheuristics for the team orienteering problem. J. Heuristics 13, 49\u201376 (2007)","journal-title":"J. Heuristics"},{"key":"559_CR5","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., Speranza, M.G.: The capacitated team orienteering and profitable tour problems. J. Oper. Res. Soc. 60, 831\u2013842 (2009)","journal-title":"J. Oper. Res. Soc."},{"key":"559_CR6","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s10288-006-0009-1","volume":"5","author":"S Boussier","year":"2007","unstructured":"Boussier, S., Feillet, D., Gendreau, M.: An exact algorithm for team orienteering problems. 4OR Q. J. Oper. Res. 5, 211\u2013230 (2007)","journal-title":"4OR Q. J. Oper. Res."},{"key":"559_CR7","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0305-0548(94)90065-5","volume":"21","author":"SE Butt","year":"1994","unstructured":"Butt, S.E., Cavalier, T.M.: A heuristic for the multiple tour maximum collection problem. Comput. Oper. Res. 21, 101\u2013111 (1994)","journal-title":"Comput. Oper. Res."},{"key":"559_CR8","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/0377-2217(94)00289-4","volume":"88","author":"I-M Chao","year":"1996","unstructured":"Chao, I.-M., Golden, B., Wasil, E.A.: The team orienteering problem. Eur. J. Oper. Res. 88, 464\u2013474 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"559_CR9","first-page":"315","volume-title":"Combinatorial Optimization","author":"N Christofides","year":"1979","unstructured":"Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (eds.) Combinatorial Optimization, pp. 315\u2013338. Wiley, Chichester (1979)"},{"key":"559_CR10","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/trsc.1030.0079","volume":"39","author":"D Feillet","year":"2005","unstructured":"Feillet, D., Dejax, P., Gendreau, M.: Traveling salesman problems with profits. Transp. Sci. 39, 188\u2013205 (2005)","journal-title":"Transp. Sci."},{"key":"559_CR11","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1016\/j.cie.2007.10.001","volume":"54","author":"L Ke","year":"2008","unstructured":"Ke, L., Archetti, C., Feng, Z.: Ants can solve the team orienteering problem. Comput. Ind. Eng. 54, 648\u2013665 (2008)","journal-title":"Comput. Ind. Eng."},{"key":"559_CR12","first-page":"287","volume":"34","author":"R Montemanni","year":"2009","unstructured":"Montemanni, R., Gambardella, L.: Ant colony system for team orienteering problem with time windows. Found. Comput. Decis. Sci. 34, 287\u2013306 (2009)","journal-title":"Found. Comput. Decis. Sci."},{"key":"559_CR13","doi-asserted-by":"crossref","first-page":"1853","DOI":"10.1016\/j.cor.2009.05.002","volume":"37","author":"W Souffriau","year":"2010","unstructured":"Souffriau, W., Vansteenwegen, P., Berghe, G.V., Van Oudheusden, D.: A path relinking approach for the team orienteering problem. Comput. Oper. Res. 37, 1853\u20131859 (2010)","journal-title":"Comput. Oper. Res."},{"key":"559_CR14","doi-asserted-by":"crossref","unstructured":"Souffriau, W., Vansteenwegen P., Berghe, G.V., Van Oudheusden, D.: The multiconstraint team orienteering problem with multiple time windows. Transp. Sci. (2011). doi: 10.1287\/trsc.1110.0377","DOI":"10.1287\/trsc.1110.0377"},{"key":"559_CR15","doi-asserted-by":"crossref","first-page":"1379","DOI":"10.1016\/j.cor.2003.11.008","volume":"32","author":"H Tang","year":"2005","unstructured":"Tang, H., Miller-Hooks, E.: A tabu search heuristic for the team orienteering problem. Comput. Oper. Res. 32, 1379\u20131407 (2005)","journal-title":"Comput. Oper. Res."},{"key":"559_CR16","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/j.cor.2009.05.012","volume":"37","author":"F Tricoire","year":"2010","unstructured":"Tricoire, F., Romauch, M., Doerner, K.F., Hartl, R.F.: Heuristics for the multi-period orienteering problem with multiple time windows. Comput. Oper. Res. 37, 351\u2013367 (2010)","journal-title":"Comput. Oper. Res."},{"key":"559_CR17","doi-asserted-by":"crossref","first-page":"3281","DOI":"10.1016\/j.cor.2009.03.008","volume":"36","author":"P Vansteenwegen","year":"2009","unstructured":"Vansteenwegen, P., Souffriau, W., Berghe, G.V., Van Oudheusden, D.: Iterated local search for the team orienteering problem with time windows. Comput. Oper. Res. 36, 3281\u20133290 (2009)","journal-title":"Comput. Oper. Res."},{"key":"559_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2010.03.045","volume":"209","author":"P Vansteenwegen","year":"2011","unstructured":"Vansteenwegen, P., Souffriau, W., Van Oudheusden, D.: The orienteering problem: a survey. Eur. J. Oper. Res. 209, 1\u201310 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"559_CR19","unstructured":"Viana, A., Uchoa, E., Poggi, M.: The team orienteering problem: formulations and branch-cut and price. In: 10th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization and Systems (ATMOS \u201910) (2010)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0559-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-012-0559-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0559-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:34Z","timestamp":1559409094000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-012-0559-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,28]]},"references-count":19,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["559"],"URL":"https:\/\/doi.org\/10.1007\/s11590-012-0559-4","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,28]]}}}