{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:15:35Z","timestamp":1742922935328,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":13,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_217","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T11:01:26Z","timestamp":1219662086000},"page":"1252-1254","source":"Crossref","is-referenced-by-count":0,"title":["General Routing Problem"],"prefix":"10.1007","author":[{"given":"Richard","family":"Eglese","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Letchford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"217_CR1_217","series-title":"Handbook Oper. Res. and Management Sci.","volume-title":"Network routing","year":"1995","unstructured":"Ball MO, Magnanti TL, Monma CL, Nemhauser GL (eds) (1995) Network routing. vol\u00a08, Handbook Oper. Res. and Management Sci. North-Holland, Amsterdam"},{"key":"217_CR2_217","unstructured":"Corber\u00e1an A, Letchford AN, Sanchis JM (1998) A\u00a0cutting-plane algorithm for the general routing problem. Working Paper"},{"key":"217_CR3_217","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1016\/S0377-2217(96)00337-2","volume":"108","author":"A. Corber\u00e1an","year":"1998","unstructured":"Corber\u00e1an A, Sanchis JM (1998) The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra. Europ J Oper Res 108:538\u2013550","journal-title":"Europ. J. Oper. Res."},{"key":"217_CR4_217","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01582008","volume":"33","author":"G. Cornu\u00e9;jols","year":"1985","unstructured":"Cornu\u00e9;jols G, Fonlupt J, Naddef D (1985) The travelling salesman problem on a\u00a0graph and some related integer polyhedra. Math Program 33:1\u201327","journal-title":"Math. Program."},{"key":"217_CR5_217","first-page":"B73","volume":"13","author":"J. Edmonds","year":"1963","unstructured":"Edmonds J (1963) The Chinese postman problem. Oper Res 13:B73\u2013B77","journal-title":"Oper. Res."},{"key":"217_CR6_217","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J. Edmonds","year":"1973","unstructured":"Edmonds J, Johnson EL (1973) Matchings, Euler tours and the Chinese postman. Math Program 5:88\u2013124","journal-title":"Math. Program."},{"key":"217_CR7_217","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0377-2217(85)90151-1","volume":"21","author":"B. Fleischmann","year":"1985","unstructured":"Fleischmann B (1985) A\u00a0cutting-plane procedure for the travelling salesman problem on a\u00a0road network. Europ J Oper Res 21:307\u2013317","journal-title":"Europ. J. Oper. Res."},{"key":"217_CR8_217","first-page":"237","volume":"1","author":"M. Guan","year":"1962","unstructured":"Guan M (1962) Graphic programming using odd or even points. Chinese Math 1:237\u2013277","journal-title":"Chinese Math."},{"key":"217_CR9_217","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0020-0190(92)90161-N","volume":"41","author":"K. Jansen","year":"1992","unstructured":"Jansen K (1992) An approximation algorithm for the general routing problem. Inform Process Lett 41:333\u2013339","journal-title":"Inform. Process. Lett."},{"key":"217_CR10_217","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1002\/net.3230060305","volume":"6","author":"J.K. Lenstra","year":"1976","unstructured":"Lenstra JK, Rinnooy Kan AHG (1976) On general routing problems. Networks 6:273\u2013280","journal-title":"Networks"},{"key":"217_CR11_217","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0377-2217(96)00346-3","volume":"96","author":"A.N. Letchford","year":"1997","unstructured":"Letchford AN (1997) New inequalities for the general routing problem. Europ J Oper Res 96:317\u2013322","journal-title":"Europ. J. Oper. Res."},{"key":"217_CR12_217","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/S0377-2217(97)00377-9","volume":"112","author":"A.N. Letchford","year":"1999","unstructured":"Letchford AN (1999) The general routing polyhedron: A\u00a0unifying framework. Europ J Oper Res 112:122\u2013133","journal-title":"Europ. J. Oper. Res."},{"key":"217_CR13_217","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1002\/net.3230040105","volume":"4","author":"C.S. Orloff","year":"1974","unstructured":"Orloff CS (1974) A\u00a0fundamental problem in vehicle routing. Networks 4:35\u201364","journal-title":"Networks"}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_217","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T10:03:07Z","timestamp":1720692187000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_217"}},"subtitle":["GRP"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_217","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}