{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:47:23Z","timestamp":1743076043759,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030197582"},{"type":"electronic","value":"9783030197599"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-19759-9_5","type":"book-chapter","created":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T07:47:10Z","timestamp":1556351230000},"page":"59-72","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A Fully Polynomial Time Approximation Scheme for Packing While Traveling"],"prefix":"10.1007","author":[{"given":"Frank","family":"Neumann","sequence":"first","affiliation":[]},{"given":"Sergey","family":"Polyakovskiy","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[]},{"given":"Leen","family":"Stougie","sequence":"additional","affiliation":[]},{"given":"Junhua","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,28]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Bonyadi, M., Michalewicz, Z., Barone, L.: The travelling thief problem: the first step in the transition from theoretical problems to realistic problems. In: 2013 IEEE Congress on Evolutionary Computation (CEC), pp. 1037\u20131044, June 2013. https:\/\/doi.org\/10.1109\/CEC.2013.6557681","DOI":"10.1109\/CEC.2013.6557681"},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"El Yafrani, M., Ahiod, B.: Population-based vs. single-solution heuristics for the travelling thief problem. In: Proceedings of the Genetic and Evolutionary Computation Conference 2016 GECCO 2016, pp. 317\u2013324. ACM, New York (2016). https:\/\/doi.org\/10.1145\/2908812.2908847","DOI":"10.1145\/2908812.2908847"},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Faulkner, H., Polyakovskiy, S., Schultz, T., Wagner, M.: Approximate approaches to the traveling thief problem. In: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation GECCO 2015, pp. 385\u2013392. ACM, New York (2015). https:\/\/doi.org\/10.1145\/2739480.2754716","DOI":"10.1145\/2739480.2754716"},{"key":"5_CR4","unstructured":"GOODYEAR: Factors Affecting Truck Fuel Economy (2008). http:\/\/www.goodyeartrucktires.com\/pdf\/resources\/publications\/Factors Affecting Truck Fuel Economy.pdf"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Hochbaum, D.: Appromixation Algorithms for NP-hard Problems. PWS Publishing Company (1997)","DOI":"10.1145\/261342.571216"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Hoy, D., Nikolova, E.: Approximately optimal risk-averse routing policies via adaptive discretization. In: Bonet, B., Koenig, S. (eds.) Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, pp. 3533\u20133539. AAAI Press, Austin, 25\u201330 January 2015","DOI":"10.1609\/aaai.v29i1.9703"},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Lin, C., Choy, K., Ho, G., Chung, S., Lam, H.: Survey of green vehicle routing problem: past and future trends. Expert Syst. Appl. 41(4, Part 1), 1118\u20131138 (2014). https:\/\/doi.org\/10.1016\/j.eswa.2013.07.107","DOI":"10.1016\/j.eswa.2013.07.107"},{"key":"5_CR8","doi-asserted-by":"publisher","unstructured":"Mei, Y., Li, X., Yao, X.: On investigation of interdependence between subproblems of the travelling thief problem. Soft Comput. 20, 157\u2013172 (2016). https:\/\/doi.org\/10.1007\/s00500-014-1487-2","DOI":"10.1007\/s00500-014-1487-2"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36574-5","volume-title":"Algorithms for Memory Hierarchies","year":"2003","unstructured":"Meyer, U., Sanders, P., Sibeyn, J. (eds.): Algorithms for Memory Hierarchies. LNCS, vol. 2625. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36574-5"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"2271","DOI":"10.1016\/j.cor.2004.03.002","volume":"32","author":"D Pisinger","year":"2005","unstructured":"Pisinger, D.: Where are the hard knapsack problems? Comput. Oper. Res. 32, 2271\u20132284 (2005). https:\/\/doi.org\/10.1016\/j.cor.2004.03.002","journal-title":"Comput. Oper. Res."},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/j.ejor.2016.09.035","volume":"258","author":"S Polyakovskiy","year":"2017","unstructured":"Polyakovskiy, S., Neumann, F.: The packing while traveling problem. Eur. J. Oper. Res. 258, 424\u2013439 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Polyakovskiy, S., Bonyadi, M.R., Wagner, M., Michalewicz, Z., Neumann, F.: A comprehensive benchmark set and heuristics for the traveling thief problem. In: Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation GECCO 2014, pp. 477\u2013484. ACM, New York (2014). https:\/\/doi.org\/10.1145\/2576768.2598249","DOI":"10.1145\/2576768.2598249"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-319-18008-3_23","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"S Polyakovskiy","year":"2015","unstructured":"Polyakovskiy, S., Neumann, F.: Packing while traveling: mixed integer programming for a class of nonlinear knapsack problems. In: Michel, L. (ed.) CPAIOR 2015. LNCS, vol. 9075, pp. 332\u2013346. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18008-3_23"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF02243880","volume":"25","author":"P Toth","year":"1980","unstructured":"Toth, P.: Dynamic programming algorithms for the zero-one knapsack problem. Computing 25, 29\u201345 (1980). https:\/\/doi.org\/10.1007\/BF02243880","journal-title":"Computing"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Yang, G., Nikolova, E.: Approximation algorithms for route planning with nonlinear objectives. In: Schuurmans, D., Wellman, M.P. (eds.) Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, pp. 3209\u20133217. AAAI Press, Phoenix, 12\u201317 February 2016","DOI":"10.1609\/aaai.v30i1.10398"},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Zhang, J.: A survey on streaming algorithms for massive graphs. In: Aggarwal, C., Wang, H. (eds.) Managing and Mining Graph Data. Advances in Database Systems, vol. 40, pp. 393\u2013420. Springer, Boston (2010). https:\/\/doi.org\/10.1007\/978-1-4419-6045-0_13","DOI":"10.1007\/978-1-4419-6045-0_13"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects of Cloud Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19759-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T00:11:31Z","timestamp":1663373491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19759-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030197582","9783030197599"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19759-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALGOCLOUD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Aspects of Cloud Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Helsinki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Finland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algocloud2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo2018.hiit.fi\/algocloud\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}