{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T06:24:57Z","timestamp":1724567097043},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,8,27]],"date-time":"2013-08-27T00:00:00Z","timestamp":1377561600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s10878-013-9654-4","type":"journal-article","created":{"date-parts":[[2013,8,26]],"date-time":"2013-08-26T21:08:45Z","timestamp":1377551325000},"page":"545-562","source":"Crossref","is-referenced-by-count":5,"title":["Online traveling salesman problem with deadlines and service flexibility"],"prefix":"10.1007","volume":"30","author":[{"given":"Xingang","family":"Wen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huili","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,8,27]]},"reference":[{"issue":"4","key":"9654_CR1","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1007\/s004530010071","volume":"29","author":"G Ausiello","year":"2001","unstructured":"Ausiello G, Feuerstein E, Leonardi S, Stougie L, Talamo M (2001) Algorithms for the on-line travelling salesman. Algorithmica 29(4):560\u2013581","journal-title":"Algorithmica"},{"issue":"2","key":"9654_CR2","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.ipl.2004.06.013","volume":"92","author":"G Ausiello","year":"2004","unstructured":"Ausiello G, Demange M, Laura L, Paschos V (2004) Algorithms for the on-line quota traveling salesman problem. Inf Process Lett 92(2):89\u201394","journal-title":"Inf Process Lett"},{"issue":"6","key":"9654_CR3","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.ipl.2008.03.002","volume":"107","author":"G Ausiello","year":"2008","unstructured":"Ausiello G, Bonifaci V, Laura L (2008) The online prize-collecting traveling salesman problem. Inf Process Lett 107(6):199\u2013204","journal-title":"Inf Process Lett"},{"issue":"2","key":"9654_CR4","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1287\/ijoc.13.2.138.10517","volume":"13","author":"M Blom","year":"2001","unstructured":"Blom M, Krumke SO, De Paepe WE, Stougie L (2001) The online TSP against fair adversaries. INFORMS J Comput 13(2):138\u2013148","journal-title":"INFORMS J Comput"},{"issue":"2\u20133","key":"9654_CR5","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/j.tcs.2006.05.017","volume":"361","author":"S Guti\u00e9rrez","year":"2006","unstructured":"Guti\u00e9rrez S, Krumke S, Megow N, Vredeveld T (2006) How to whack moles. Theor Comput Sci 361(2\u20133):329\u2013341","journal-title":"Theor Comput Sci"},{"issue":"2","key":"9654_CR6","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1002\/net.20454","volume":"58","author":"P Jaillet","year":"2011","unstructured":"Jaillet P, Lu X (2011) Online traveling salesman problems with service flexibility. Networks 58(2):137\u2013146","journal-title":"Networks"},{"issue":"2","key":"9654_CR7","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1287\/trsc.1060.0147","volume":"40","author":"P Jaillet","year":"2006","unstructured":"Jaillet P, Wagner M (2006) Online routing problems: value of advanced information as improved competitive ratios. Transp Sci 40(2):200\u2013210","journal-title":"Transp Sci"},{"key":"9654_CR8","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1287\/opre.1070.0450","volume":"3","author":"P Jaillet","year":"2008","unstructured":"Jaillet P, Wagner M (2008) Generalized online routing new competitive ratios, resource augmentation, and asymptotic analyses. Oper Res 3:745\u2013757","journal-title":"Oper Res"},{"issue":"1","key":"9654_CR9","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"A Karlin","year":"1988","unstructured":"Karlin A, Manasse M, Rudolph L, Sleator D (1988) Competitive snoopy caching. Algorithmica 3(1):79\u2013119","journal-title":"Algorithmica"},{"key":"9654_CR10","first-page":"160","volume":"2","author":"K Katz","year":"2003","unstructured":"Katz K, Larson B, Larson R (2003) Prescription for the waiting-in-line blues entertain, enlighten, and engage. Oper Manag Crit Perspect Bus Manag 2:160","journal-title":"Oper Manag Crit Perspect Bus Manag"},{"key":"9654_CR11","unstructured":"Lipmann M (2003) On-line routing. PhD Thesis, Technische Universiteit Eindhoven"},{"issue":"2","key":"9654_CR12","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1057\/palgrave.jors.2601063","volume":"52","author":"V Portougal","year":"2001","unstructured":"Portougal V, Trietsch D (2001) Stochastic scheduling with optimal customer service. J Oper Res Soc 52(2):226\u2013233","journal-title":"J Oper Res Soc"},{"issue":"2","key":"9654_CR13","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D Sleator","year":"1985","unstructured":"Sleator D, Tarjan R (1985) Amortized efficiency of list update and paging rules. Commun ACM 28(2):202\u2013208","journal-title":"Commun ACM"},{"issue":"4","key":"9654_CR14","doi-asserted-by":"crossref","first-page":"1048","DOI":"10.1016\/j.cie.2012.07.003","volume":"63","author":"X Wen","year":"2012","unstructured":"Wen X, Xu Y, Zhang H (2012) Online traveling salesman problem with deadline and advanced information. Comput Ind Eng 63(4):1048\u20131053","journal-title":"Comput Ind Eng"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9654-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9654-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9654-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,2]],"date-time":"2020-08-02T16:01:23Z","timestamp":1596384083000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9654-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,27]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9654"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9654-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,27]]}}}