{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:49:33Z","timestamp":1725749373380},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642410185"},{"type":"electronic","value":"9783642410192"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41019-2_12","type":"book-chapter","created":{"date-parts":[[2013,9,18]],"date-time":"2013-09-18T11:31:38Z","timestamp":1379503898000},"page":"158-172","source":"Crossref","is-referenced-by-count":2,"title":["TSP with Multiple Time-Windows and Selective Cities"],"prefix":"10.1007","author":[{"given":"Marta","family":"Mesquita","sequence":"first","affiliation":[]},{"given":"Alberto","family":"Murta","sequence":"additional","affiliation":[]},{"given":"Ana","family":"Paias","sequence":"additional","affiliation":[]},{"given":"Laura","family":"Wise","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Fischetti, M., Salazar-Gonz\u00e1lez, J.-J., Toth, P.: The generalized traveling salesman and orienteering problems. In: Gutin, G., Punnen, A.P. (eds.) The Traveling Salesman Problem and its Variants, pp. 609\u2013662. Kluwer (2002)","DOI":"10.1007\/0-306-48213-4_13"},{"issue":"4","key":"12_CR2","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\u00a032(4), 263\u2013273 (1998)","journal-title":"Networks"},{"key":"12_CR3","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316801","volume-title":"Finding groups in data: an introduction to cluster analysis","author":"L. Kaufman","year":"1990","unstructured":"Kaufman, L., Rousseeuw, P.J.: Finding groups in data: an introduction to cluster analysis. Wiley, New York (1990)"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ejor.2012.01.030","volume":"220","author":"N. Labadie","year":"2012","unstructured":"Labadie, N., Mansini, R., Melechovsky, J., Calvo, R.W.: The team orienteering problem with time windows: An LP-based granular variable neighborhood search. European Journal of Operational Research\u00a0220, 15\u201327 (2012)","journal-title":"European Journal of Operational Research"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D. Pisinger","year":"2007","unstructured":"Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Computers & Operations Research\u00a034, 2403\u20132435 (2007)","journal-title":"Computers & Operations Research"},{"issue":"4","key":"12_CR6","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S. Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: An adaptative large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science\u00a040(4), 455\u2013472 (2006)","journal-title":"Transportation Science"},{"key":"12_CR7","doi-asserted-by":"publisher","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. Computers & Operations Research\u00a037, 351\u2013367 (2010)","journal-title":"Computers & Operations Research"},{"key":"12_CR8","doi-asserted-by":"publisher","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., Oudheusden, D.V.: Iterated local search for the team orienteering problem with time windows. Computers & Operations Research\u00a036, 3281\u20133290 (2009)","journal-title":"Computers & Operations Research"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2010.03.045","volume":"209","author":"P. Vansteenwegen","year":"2011","unstructured":"Vansteenwegen, P., Souffriau, W., Oudheusden, D.V.: The orienteering problem: A survey. European Journal of Operational Research\u00a0209, 1\u201310 (2011)","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41019-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,24]],"date-time":"2019-07-24T01:44:56Z","timestamp":1563932696000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41019-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642410185","9783642410192"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41019-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}