{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:27:24Z","timestamp":1725809244291},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319126906"},{"type":"electronic","value":"9783319126913"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12691-3_38","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T21:11:32Z","timestamp":1415999492000},"page":"522-534","source":"Crossref","is-referenced-by-count":3,"title":["Maximizing Revenues for On-Line Dial-a-Ride"],"prefix":"10.1007","author":[{"given":"Ananya","family":"Christman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William","family":"Forcier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"key":"38_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1007\/3-540-46541-3_53","volume-title":"STACS 2000","author":"N Ascheuer","year":"2000","unstructured":"Ascheuer, N., Krumke, S.O., Rambau, J.: Online dial-a-ride problems: minimizing the completion time. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 639\u2013650. Springer, Heidelberg (2000)"},{"issue":"4","key":"38_CR2","doi-asserted-by":"publisher","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.: Algorithms for the on-line traveling salesman. Algorithmica 29(4), 560\u2013581 (2001)","journal-title":"Algorithmica"},{"issue":"2","key":"38_CR3","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.jda.2007.03.002","volume":"6","author":"G Ausiello","year":"2008","unstructured":"Ausiello, G., Bonifaci, V., Laura, L.: The on-line asymmetric traveling salesman problem. J. Discrete Algorithms 6(2), 290\u2013298 (2008)","journal-title":"J. Discrete Algorithms"},{"issue":"6","key":"38_CR4","doi-asserted-by":"publisher","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.: The on-line prize-collecting traveling salesman problem. Inf. Process. Lett. 107(6), 199\u2013204 (2008)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"38_CR5","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s00453-004-1088-z","volume":"39","author":"B Broden","year":"2004","unstructured":"Broden, B., Hammar, M., Nilsson, B.: Online and offline algorithms for the time-dependent TSP with time zones. Algorithmica 39(4), 299\u2013319 (2004)","journal-title":"Algorithmica"},{"key":"38_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.: Online traveling salesman problems with flexibility. Networks 58, 137\u2013146 (2011)","journal-title":"Networks"},{"issue":"3","key":"38_CR7","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1287\/opre.1070.0450","volume":"56","author":"P Jaillet","year":"2008","unstructured":"Jaillet, P., Wagner, M.: Generalized online routing: new competitive ratios, resource augmentation and asymptotic analyses. Oper. Res. 56(3), 745\u2013757 (2008)","journal-title":"Oper. Res."},{"key":"38_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1002\/net.20013","volume":"44","author":"S Krumke","year":"2004","unstructured":"Krumke, S.: On minimizing the maximum flow time in the online dial-a-ride problem. Networks 44, 41\u201346 (2004)","journal-title":"Networks"},{"key":"38_CR9","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s00453-004-1116-z","volume":"40","author":"M Lipmann","year":"2004","unstructured":"Lipmann, M., Lu, X., de Paepe, W.E., Sitters, R.A., Stougie, L.: On-line dial-a-ride problems under restricted information model. Algorithmica 40, 319\u2013329 (2004)","journal-title":"Algorithmica"},{"issue":"1","key":"38_CR10","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0304-3975(00)00261-9","volume":"268","author":"L Stougie","year":"2001","unstructured":"Stougie, L., Feuerstein, E.: On-line single-server dial-a-ride problems. Theor. Comput. Sci. 268(1), 91\u2013105 (2001)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12691-3_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,26]],"date-time":"2020-08-26T21:31:47Z","timestamp":1598477507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-12691-3_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319126906","9783319126913"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12691-3_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}