{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T18:32:06Z","timestamp":1772649126592,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,6,25]],"date-time":"2015-06-25T00:00:00Z","timestamp":1435190400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10107-015-0927-9","type":"journal-article","created":{"date-parts":[[2015,6,24]],"date-time":"2015-06-24T03:59:34Z","timestamp":1435118374000},"page":"145-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["On the adaptivity gap of stochastic orienteering"],"prefix":"10.1007","volume":"154","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Viswanath","family":"Nagarajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,25]]},"reference":[{"key":"927_CR1","doi-asserted-by":"crossref","unstructured":"Bansal, N., Blum, A., Chawla, S., Meyerson, A.: Approximation algorithms for deadline-TSP and vehicle routing with time-windows. In: STOC, pp. 166\u2013174 (2004)","DOI":"10.1145\/1007352.1007385"},{"issue":"4","key":"927_CR2","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1007\/s00453-011-9511-8","volume":"63","author":"N Bansal","year":"2012","unstructured":"Bansal, N., Gupta, A., Li, J., Mestre, J., Nagarajan, V., Rudra, A.: When LP is the cure for your matching woes: improved bounds for stochastic matchings. Algorithmica 63(4), 733\u2013762 (2012)","journal-title":"Algorithmica"},{"key":"927_CR3","unstructured":"Bansal, N., Nagarajan, V.: On the adaptivity gap of stochastic orienteering. CoRR abs\/1311.3623 (2013)"},{"key":"927_CR4","doi-asserted-by":"crossref","unstructured":"Bhalgat, A.: A $$(2+\\epsilon )$$ ( 2 + \u03f5 ) -approximation algorithm for the stochastic knapsack problem (2011). Unpublished manuscript","DOI":"10.1137\/1.9781611973082.127"},{"key":"927_CR5","doi-asserted-by":"crossref","unstructured":"Bhalgat, A., Goel, A., Khanna, S.: Improved approximation results for stochastic knapsack problems. In: SODA, pp. 1647\u20131665 (2011)","DOI":"10.1137\/1.9781611973082.127"},{"issue":"2","key":"927_CR6","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1137\/050645464","volume":"37","author":"A Blum","year":"2007","unstructured":"Blum, A., Chawla, S., Karger, D.R., Lane, T., Meyerson, A., Minkoff, M.: Approximation algorithms for orienteering and discounted-reward TSP. SIAM J. Comput. 37(2), 653\u2013670 (2007)","journal-title":"SIAM J. Comput."},{"key":"927_CR7","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Korula, N., P\u00e1l, M.: Improved algorithms for orienteering and related problems. ACM TALG 8(3) (2012)","DOI":"10.1145\/2229163.2229167"},{"key":"927_CR8","doi-asserted-by":"crossref","unstructured":"Chen, N., Immorlica, N., Karlin, A.R., Mahdian, M., Rudra, A.: Approximating matches made in heaven. In: International Colloquium on Automata, Languages and Programming (ICALP), pp. 266\u2013278 (2009)","DOI":"10.1007\/978-3-642-02927-1_23"},{"issue":"4","key":"927_CR9","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1287\/moor.1080.0330","volume":"33","author":"BC Dean","year":"2008","unstructured":"Dean, B.C., Goemans, M.X., Vondr\u00e1k, J.: Approximating the stochastic knapsack problem: the benefit of adaptivity. Math. Oper. Res. 33(4), 945\u2013964 (2008)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"927_CR10","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1137\/S0097539704446232","volume":"37","author":"N Garg","year":"2007","unstructured":"Garg, N., K\u00f6nemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. SIAM J. Comput. 37(2), 630\u2013652 (2007)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"927_CR11","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D","volume":"34","author":"BL Golden","year":"1987","unstructured":"Golden, B.L., Levy, L., Vohra, R.: The orienteering problem. Naval Res. Logist. 34(3), 307\u2013318 (1987)","journal-title":"Naval Res. Logist."},{"key":"927_CR12","doi-asserted-by":"crossref","unstructured":"Guha, S., Munagala, K.: Multi-armed bandits with metric switching costs. In: ICALP, pp. 496\u2013507 (2009)","DOI":"10.1007\/978-3-642-02930-1_41"},{"key":"927_CR13","doi-asserted-by":"crossref","unstructured":"Gupta, A., Krishnaswamy, R., Molinaro, M., Ravi, R.: Approximation algorithms for correlated knapsacks and non-martingale bandits. In: FOCS, pp. 827\u2013836 (2011)","DOI":"10.1109\/FOCS.2011.48"},{"key":"927_CR14","doi-asserted-by":"crossref","unstructured":"Gupta, A., Krishnaswamy, R., Nagarajan, V., Ravi, R.: Approximation algorithms for stochastic orienteering. In: SODA, pp. 1522\u20131538 (2012)","DOI":"10.1137\/1.9781611973099.121"},{"key":"927_CR15","doi-asserted-by":"crossref","unstructured":"Ma, W.: Improvements and generalizations of stochastic knapsack and multi-armed bandit approximation algorithms. In: SODA (2014)","DOI":"10.1137\/1.9781611973402.85"},{"key":"927_CR16","doi-asserted-by":"crossref","unstructured":"Plotkin, S.A., Shmoys, D.B., Tardos, \u00c9.: Fast approximation algorithms for fractional packing and covering problems. In: FOCS, pp. 495\u2013504 (1991)","DOI":"10.1109\/SFCS.1991.185411"},{"key":"927_CR17","doi-asserted-by":"crossref","unstructured":"Tong, Z.: Data dependent concentration bounds for sequential prediction algorithms. In: COLT, pp. 173\u2013187 (2005)","DOI":"10.1007\/11503415_12"},{"issue":"1","key":"927_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2010.03.045","volume":"209","author":"P Vansteenwegena","year":"2011","unstructured":"Vansteenwegena, P., Souffriaua, W., Oudheusdena, D.V.: The orienteering problem: a survey. Eur. J. Oper. Res. 209(1), 1\u201310 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"927_CR19","unstructured":"Weyland, D.: Stochastic vehicle routing\u2014from theory to practice. Ph.D. thesis, University of Lugano, Switzerland (2013)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0927-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0927-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0927-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,27]],"date-time":"2019-08-27T13:09:55Z","timestamp":1566911395000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0927-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,25]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["927"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0927-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,25]]}}}