{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T19:44:23Z","timestamp":1760730263602},"reference-count":28,"publisher":"Informa UK Limited","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2007,12]]},"DOI":"10.1080\/10556780701550026","type":"journal-article","created":{"date-parts":[[2011,7,1]],"date-time":"2011-07-01T03:49:34Z","timestamp":1309492174000},"page":"971-983","source":"Crossref","is-referenced-by-count":13,"title":["New policies for the dynamic traveling salesman problem"],"prefix":"10.1080","volume":"22","author":[{"given":"Gianpaolo","family":"Ghiani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonella","family":"Quaranta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chefi","family":"Triki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","reference":[{"key":"CIT0001","first-page":"141","volume-title":"Handbook in OR and MS","author":"Powell W. B.","year":"1995"},{"key":"CIT0002","first-page":"223","volume-title":"Vehicle Routing: Methods and Studies","author":"Psaraftis H. N.","year":"1988"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1007\/BF02098286"},{"key":"CIT0004","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/978-1-4615-5755-5_5","volume-title":"Fleet Management and Logistics","author":"Gendreau M.","year":"1998"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00915-3"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1287\/opre.39.4.601"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1287\/opre.41.1.60"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00189-1"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00260-4"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1287\/opre.36.6.929"},{"key":"CIT0011","first-page":"293","volume-title":"Vehicle Routing: Methods and Studies","author":"Jaillet P.","year":"1988"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1287\/opre.40.3.574"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1287\/opre.44.2.286"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00050-X"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1287\/inte.18.1.21"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.30.3.195"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1030.0071"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1040.0124"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010071"},{"key":"CIT0020","volume-title":"Online Computation and Competitive Analysis","author":"Borodin A.","year":"1998"},{"key":"CIT0021","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04331-8","volume-title":"Online Optimization of Large Scale Systems","author":"Grotschel M.","year":"2001"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOSH.0000019683.85186.57"},{"key":"CIT0023","unstructured":"Krumke, S. O., Laura, L., Lipmann, M., Marchetti-Spaccamela, A., De Paepe, W. E., Poensgen, D. and Stougie, L. Non-abusiveness helps: anO(1)-competitive algorithm for minimizing the maximum flow time in the online traveling salesman problem. Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization. Lecture Notes in Computer Scienc, Vol. 2462, pp.200\u2013214. Springer."},{"key":"CIT0024","doi-asserted-by":"crossref","unstructured":"Ascheuer, N., Krumke, S. O. and Rambau, J. Online dial-a-ride problems: minimizing the completion time. Proceedings of the 17th International Symposium on Theoretical Aspects of Computer Scienc. Lecture Notes in Computer Scienc, Vol. 1770, pp.639\u2013650. Springer.","DOI":"10.1007\/3-540-46541-3_53"},{"key":"CIT0025","doi-asserted-by":"crossref","unstructured":"Hauptmeier, D., Krumke, S. O. and Rambau, J. The online dial-a-ride problem under reasonable load. Proceedings of the 4th Italian Conference on Algorithms and Complexity. Lecture Notes in Computer Scienc, Vol. 1767, pp.125\u2013136. Springer.","DOI":"10.1007\/3-540-46521-9_11"},{"key":"CIT0027","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100034095"},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176994411"},{"key":"CIT0029","volume-title":"Introduction to Stochastic Programming","author":"Birge J. R.","year":"1997"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556780701550026","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T16:00:25Z","timestamp":1560355225000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/10556780701550026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12]]},"references-count":28,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2007,12]]}},"alternative-id":["10.1080\/10556780701550026"],"URL":"https:\/\/doi.org\/10.1080\/10556780701550026","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12]]}}}