{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T15:04:10Z","timestamp":1781017450395,"version":"3.54.1"},"reference-count":12,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2011,1]]},"DOI":"10.1051\/ro\/2011102","type":"journal-article","created":{"date-parts":[[2011,5,10]],"date-time":"2011-05-10T05:36:02Z","timestamp":1305005762000},"page":"37-61","source":"Crossref","is-referenced-by-count":198,"title":["Balancing the stations of a self service \u201cbike hire\u201d system"],"prefix":"10.1051","volume":"45","author":[{"given":"Mike","family":"Benchimol","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pascal","family":"Benchimol","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Beno\u00eet","family":"Chappert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arnaud","family":"de la Taille","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabien","family":"Laroche","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Meunier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ludovic","family":"Robinet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"250","published-online":{"date-parts":[[2011,5,10]]},"reference":[{"key":"R1","unstructured":"S. Anily and J. Bramel, Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries.Nav. Res. Logist.(1997)."},{"key":"R2","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1002\/net.3230220408","volume":"22","author":"Anily","year":"1992","journal-title":"Networks"},{"key":"R3","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1016\/S0377-2217(97)00290-7","volume":"106","author":"Augerat","year":"1998","journal-title":"Eur. J. Oper. Res."},{"key":"R4","doi-asserted-by":"crossref","first-page":"2133","DOI":"10.1137\/S0097539795295468","volume":"28","author":"Chalasani","year":"1999","journal-title":"SIAM J. Comput."},{"key":"R5","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1137\/S0097539701392056","volume":"31","author":"Charikar","year":"2001","journal-title":"SIAM J. Comput."},{"key":"R6","unstructured":"N. Christofides, Worst-case analysis for a new heuristic for the Traveling Salesman problem, inSymposium on New Directions and Recent Results in Algorithms and Complexity, edited by J.F. Traub, Academic Press (1976)."},{"key":"R7","unstructured":"M.R. Garey and D.S. Johnson,Computers and intractability: a guide to the theory of NP-completness. W.H. Freeman (1979)."},{"key":"R8","unstructured":"H. Hern\u00e1ndez-P\u00e9rz and J.-J. Salazar-Gonz\u00e1lez, The one-commodity pickup-and-delivery travelling salesman problem, inLect. Notes Comput. Sci.2570(2002) 89\u2013104."},{"key":"R9","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.dam.2003.09.013","volume":"145","author":"Hern\u00e1ndez-P\u00e9rz","year":"2004","journal-title":"Discr. Appl. Math."},{"key":"R10","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0167-6377(91)90016-I","volume":"10","author":"Hoogeveen","year":"1991","journal-title":"Oper. Res. Lett."},{"key":"R11","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/BF01456961","volume":"77","author":"K\u00f6nig","year":"1916","journal-title":"Math. Ann."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"A. Lim, F. Wang and Z. Xu, The capacitated traveling salesman problem with pickups and deliveries on a tree, inLect. Notes Comput. Sci. Algorithms and Computation. Springer Berlin\/Heidelberg3827(2005) 1061\u20131070.","DOI":"10.1007\/11602613_105"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2011102\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T13:31:44Z","timestamp":1560173504000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2011102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1]]},"references-count":12,"journal-issue":{"issue":"1"},"alternative-id":["ro110003"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2011102","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1]]}}}