{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T15:31:57Z","timestamp":1726846317587},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2000,4]]},"DOI":"10.1016\/s0377-2217(99)00073-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:10:52Z","timestamp":1027609852000},"page":"11-17","source":"Crossref","is-referenced-by-count":117,"title":["An efficient transformation of the generalized vehicle routing problem"],"prefix":"10.1016","volume":"122","author":[{"given":"Gianpaolo","family":"Ghiani","sequence":"first","affiliation":[]},{"given":"Gennaro","family":"Improta","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00073-9_BIB1","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF02085634","article-title":"A branch-and-cut algorithm for vehicle routing problems","volume":"50","author":"Araque","year":"1994","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(99)00073-9_BIB2","unstructured":"Assad, A., Golden, B., 1995. Arc routing methods and applications. In: Ball, M., Magnanti, T., Monma, C., Nemhauser, G. (Eds.), Handbook of Operations Research and Management Science: Networks, North-Holland, Amsterdam"},{"issue":"2","key":"10.1016\/S0377-2217(99)00073-9_BIB3","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1287\/opre.43.2.231","article-title":"Arc routing problems, Part 1: The Chinese postman problem","volume":"43","author":"Eiselt","year":"1995","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/S0377-2217(99)00073-9_BIB4","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1287\/opre.43.3.399","article-title":"Arc routing problems, Part 2: The rural postman problem","volume":"43","author":"Eiselt","year":"1995","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00073-9_BIB5","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.3230260206","article-title":"The symmetric generalized traveling salesman polytope","volume":"26","author":"Fischetti","year":"1996","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(99)00073-9_BIB6","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.45.3.378","article-title":"A branch and cut algorithm for the symmetric generalized traveling salesman problem","volume":"45","author":"Fischetti","year":"1997","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00073-9_BIB7","unstructured":"Hertz, A., Laporte, G., Mittaz, M., 1996. A tabu search heuristic for the capacitated arc routing problem. Working Paper 96-08, D\u00e9partment de Math\u00e9matiques, Ecole Polytechnique F\u00e9d\u00e9ral de Lausanne"},{"issue":"2","key":"10.1016\/S0377-2217(99)00073-9_BIB8","first-page":"155","article-title":"Tour construction algorithm for the capacitated arc routing problem","volume":"9","author":"Hirabayashi","year":"1992","journal-title":"Asia Pacific Journal of Operations Research"},{"key":"10.1016\/S0377-2217(99)00073-9_BIB9","unstructured":"Laporte, G., 1988. Location-routing problems. In: Golden, B.L., Assad, A.A. (Eds.), Vehicle Routing: Methods and Studies. North-Holland, Amsterdam, pp. 163\u2013197"},{"key":"10.1016\/S0377-2217(99)00073-9_BIB10","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.1057\/jors.1996.190","article-title":"Some applications of the generalized traveling salesman problem","volume":"47","author":"Laporte","year":"1996","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(99)00073-9_BIB11","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0191-2615(89)90029-5","article-title":"An algorithm for the design of mail box collection routes in urban areas","volume":"23","author":"Laporte","year":"1989","journal-title":"Transportation Research B"},{"key":"10.1016\/S0377-2217(99)00073-9_BIB12","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1287\/opre.39.4.623","article-title":"A Lagrangean based approach for the asymmetric generalized traveling salesman problem","volume":"39","author":"Noon","year":"1991","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00073-9_BIB13","first-page":"39","article-title":"An efficient transformation of the generalized traveling salesman problem","volume":"31","author":"Noon","year":"1993","journal-title":"INFOR"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799000739?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799000739?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T19:52:14Z","timestamp":1555962734000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799000739"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,4]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,4]]}},"alternative-id":["S0377221799000739"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00073-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"type":"print","value":"0377-2217"}],"subject":[],"published":{"date-parts":[[2000,4]]}}}