{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,29]],"date-time":"2026-07-29T16:57:47Z","timestamp":1785344267381,"version":"3.55.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,7,18]],"date-time":"2006-07-18T00:00:00Z","timestamp":1153180800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR"],"published-print":{"date-parts":[[2007,9,24]]},"DOI":"10.1007\/s10288-006-0009-1","type":"journal-article","created":{"date-parts":[[2006,7,17]],"date-time":"2006-07-17T06:25:50Z","timestamp":1153117550000},"page":"211-230","source":"Crossref","is-referenced-by-count":170,"title":["An exact algorithm for team orienteering problems"],"prefix":"10.1007","volume":"5","author":[{"given":"Sylvain","family":"Boussier","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dominique","family":"Feillet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michel","family":"Gendreau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,7,18]]},"reference":[{"key":"9_CR1","unstructured":"Archetti C, Hertz A, Speranza MG (2005) Metaheuristics for the team orienteering problem. Technical Report GERAD-2005-47, Groupes d\u2019Etudes et de Recherche en Analyse des Dcisions"},{"issue":"4","key":"9_CR2","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/S0305-0548(98)00071-9","volume":"26","author":"SE Butt","year":"1999","unstructured":"Butt SE, Ryan DM (1999) An optimal solution procedure for the multiple tour maximum collection problem using column generation. Comput Oper Res 26(4): 427\u2013441","journal-title":"Comput Oper Res"},{"issue":"3","key":"9_CR3","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 BL, Wasil EA (1996) The team orienteering problem. Eur J Oper Res 88(3): 464\u2013474","journal-title":"Eur J Oper Res"},{"key":"9_CR4","volume-title":"Column generation","year":"2005","unstructured":"Desaulniers G, Desrosiers J, Solomon MM (eds) (2005) Column generation. GERAD 25th Anniversary Series. Springer, Berlin Heidelberg New York"},{"issue":"2","key":"9_CR5","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M Desrochers","year":"1992","unstructured":"Desrochers M, Desrosiers J, Solomon MM (1992) A new optimization algorithm for the vehicle routing problem with time windows. Oper Res 40(2): 342\u2013354","journal-title":"Oper Res"},{"issue":"(3","key":"9_CR6","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/net.20033","volume":"44","author":"D Feillet","year":"2004","unstructured":"Feillet D, Dejax P, Gendreau M, Gueguen C (2004) An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks 44 (3): 216\u2013229","journal-title":"Networks"},{"issue":"2","key":"9_CR7","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/trsc.1030.0079","volume":"39","author":"D Feillet","year":"2005a","unstructured":"Feillet D, Dejax P, Gendreau M (2005a). Traveling salesman problems with profits. Transp Sci 39(2): 188\u2013205","journal-title":"Transp Sci"},{"key":"9_CR8","unstructured":"Feillet D, Gendreau M, Rousseau LM (2005b) New refinements for the solution of vehicle routing problems with branch and price. Technical Report CRT-2005-08, Centre de Recherche sur les Transports"},{"key":"9_CR9","unstructured":"Gueguen C (1999) M\u00e9thodes de r\u00e9solution exacte pour les probl\u00e8mes de tourn\u00e9es de v\u00e9hicules. Th\u00e9se de doctorat, \u00e9cole Centrale Paris"},{"key":"9_CR10","unstructured":"Gueguen C (2006) Private communication"},{"key":"9_CR11","unstructured":"Harvey W, Ginsberg M (1995) Limited discrepancy search. In: Proceedings of the 14th international joint conference on artificial intelligence (IJCAI-95), Morgan Kaufmann, Montr\u00e9al, pp. 607\u2013615"},{"key":"9_CR12","unstructured":"Hayari N, Manier M-A, Bloch C, El Moudni A (2003) Un algorithme \u00e9volutionniste pour le probl\u00e8me de tourn\u00e9es s\u00e9lectives avec contraintes de fen\u00eatre de temps. In 4\u00e8me Conf\u00e9rence Francophone de MOd\u00e9lisation et SIMulation MOSIM\u201903, Toulouse"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Irnich S, Desaulniers G (2005) Shortest path problems with resource constraints. In: Desaulniers G, Desrosiers J, Solomon MM, (eds) Column generation, GERAD 25th Anniversary Series, chap 2, pp. 33\u201365, Springer, Berlin Heidelberg New York","DOI":"10.1007\/0-387-25486-2_2"},{"key":"9_CR14","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0166-218X(90)90100-Q","volume":"26","author":"G Laporte","year":"1990","unstructured":"Laporte G, Martello S (1990) The selective traveling salesman problem. Discrete Appl Math 26:193\u2013207","journal-title":"Discrete Appl Math"},{"issue":"6","key":"9_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 (2005) A tabu search heuristic for the team orienteering problem. Comput Oper Res 32(6): 1379\u20131407","journal-title":"Comput Oper Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-006-0009-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-006-0009-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-006-0009-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:54Z","timestamp":1559131974000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-006-0009-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,18]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,9,24]]}},"alternative-id":["9"],"URL":"https:\/\/doi.org\/10.1007\/s10288-006-0009-1","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7,18]]}}}