{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T22:23:49Z","timestamp":1751495029515},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319203270"},{"type":"electronic","value":"9783319203287"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20328-7_9","type":"book-chapter","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T10:47:36Z","timestamp":1443696456000},"page":"145-155","source":"Crossref","is-referenced-by-count":1,"title":["A Routing\/Assignment Problem in Garden Maintenance Services"],"prefix":"10.1007","author":[{"given":"J. Orestes","family":"Cerdeira","sequence":"first","affiliation":[]},{"given":"Manuel","family":"Cruz","sequence":"additional","affiliation":[]},{"given":"Ana","family":"Moura","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"AMPL modelling language, Mar 2013. Available online at: \n                  http:\/\/www.ampl.com\/"},{"key":"9_CR2","unstructured":"Ascheuer, N., Fischetti, M., Gr\u00f6tschel, M.: Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Math. Progr. Ser. A 90, 475\u2013506 (2001)"},{"issue":"1","key":"9_CR3","first-page":"104","volume":"39","author":"O. Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy, O., Gendreau, M.: Vehicle routing problem with time windows, Part I: route construction and local search algorithms. Trans. Sci. 39(1), 104\u2013118 (2005)","journal-title":"Part I: route construction and local search algorithms. Trans. Sci."},{"issue":"4","key":"9_CR4","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G. Clarke","year":"1964","unstructured":"Clarke, G., Wright, J.W.: Scheduling of vehicles from a Central Depot to a number of delivery points. Oper. Res. 12(4), 568\u2013581 (1964)","journal-title":"Oper. Res."},{"key":"9_CR5","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/1.9781611973594.ch5","volume-title":"Vehicle Routing: Problems, Methods, and Applications, 2nd edn. MOS-SIAM Series on Optimization","author":"G. Desaulniers","year":"2014","unstructured":"Desaulniers, G., Madsen, O.B.G., Ropke, S.: Vehicle routing problems with time windows. In: Toth, P., Vigo, D. (eds.) Vehicle Routing: Problems, Methods, and Applications, 2nd edn. MOS-SIAM Series on Optimization, pp. 119\u2013159. SIAM, Philadelphia (2014)"},{"key":"9_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77778-8","volume-title":"The Vehicle Routing Problem: Latest Advances and New Challenges","author":"B.L. Golden","year":"2008","unstructured":"Golden, B.L., Raghavan, S., Wasil, E.A.: The Vehicle Routing Problem: Latest Advances and New Challenges. Springer, New York (2008)"},{"issue":"4","key":"9_CR7","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n\n5\u22152 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"key":"9_CR8","first-page":"66","volume":"4","author":"S.N. Kumar","year":"2012","unstructured":"Kumar, S.N., Panneerselvam, R.: A survey on the vehicle routing problem and its variants. Intell. Inf. Manag. 4, 66\u201374 (2012)","journal-title":"Intell. Inf. Manag."},{"key":"9_CR9","unstructured":"MATLAB, The MathWorks, Inc., Natick, (2010). \n                  http:\/\/www.mathworks.com\/products\/matlab\/"},{"key":"9_CR10","unstructured":"NEOS Server, Mar 2013. Available online at: \n                  http:\/\/www.neos-server.org\/"},{"key":"9_CR11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718515","volume-title":"The Vehicle Routing Problem","author":"P. Toth","year":"2002","unstructured":"Toth, P., Vigo, D.: The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2002)"},{"key":"9_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, 2nd edn. MOS-SIAM Series on Optimization. SIAM, Philadelphia (2014)","edition":"2"}],"container-title":["CIM Series in Mathematical Sciences","Operational Research"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20328-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T23:20:29Z","timestamp":1559258429000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-20328-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319203270","9783319203287"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20328-7_9","relation":{},"ISSN":["2364-950X","2364-9518"],"issn-type":[{"type":"print","value":"2364-950X"},{"type":"electronic","value":"2364-9518"}],"subject":[],"published":{"date-parts":[[2015]]}}}