{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:34:07Z","timestamp":1761896047072,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319180076"},{"type":"electronic","value":"9783319180083"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","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":[[2015]]},"DOI":"10.1007\/978-3-319-18008-3_23","type":"book-chapter","created":{"date-parts":[[2015,4,15]],"date-time":"2015-04-15T07:32:51Z","timestamp":1429083171000},"page":"332-346","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems"],"prefix":"10.1007","author":[{"given":"Sergey","family":"Polyakovskiy","sequence":"first","affiliation":[]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,16]]},"reference":[{"issue":"1","key":"23_CR1","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1287\/ijoc.15.1.82.15157","volume":"15","author":"D Applegate","year":"2003","unstructured":"Applegate, D., Cook, W.J., Rohe, A.: Chained lin-kernighan for large traveling salesman problems. INFORMS Journal on Computing 15(1), 82\u201392 (2003)","journal-title":"INFORMS Journal on Computing"},{"issue":"6","key":"23_CR2","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1002\/net.3230190602","volume":"19","author":"E Balas","year":"1989","unstructured":"Balas, E.: The prize collecting traveling salesman problem. Networks 19(6), 621\u2013636 (1989)","journal-title":"Networks"},{"key":"23_CR3","unstructured":"Bonyadi, M.R., Michalewicz, Z., Barone, L.: The travelling thief problem: the first step in the transition from theoretical problems to realistic problems. In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2013, pp. 1037\u20131044. IEEE, Cancun, June 20\u201323, 2013"},{"issue":"3","key":"23_CR4","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1016\/S0377-2217(01)00179-5","volume":"138","author":"KM Bretthauer","year":"2002","unstructured":"Bretthauer, K.M., Shetty, B.: The nonlinear knapsack problem - algorithms and applications. European Journal of Operational Research 138(3), 459\u2013472 (2002)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"23_CR5","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/S0097539700382820","volume":"35","author":"C Chekuri","year":"2005","unstructured":"Chekuri, C., Khanna, S.: A polynomial time approximation scheme for the multiple knapsack problem. SIAM J. Comput. 35(3), 713\u2013728 (2005)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"23_CR6","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1016\/j.orl.2005.01.004","volume":"33","author":"S Elhedhli","year":"2005","unstructured":"Elhedhli, S.: Exact solution of a class of nonlinear knapsack problems. Oper. Res. Lett. 33(6), 615\u2013624 (2005)","journal-title":"Oper. Res. Lett."},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/3-540-44634-6_20","volume-title":"Algorithms and Data Structures","author":"T Erlebach","year":"2001","unstructured":"Erlebach, T., Kellerer, H., Pferschy, U.: Approximating multi-objective knapsack problems. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol. 2125, p. 210. Springer, Heidelberg (2001)"},{"key":"23_CR8","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)"},{"issue":"3","key":"23_CR9","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0167-6377(95)00009-9","volume":"17","author":"DS Hochbaum","year":"1995","unstructured":"Hochbaum, D.S.: A nonlinear knapsack problem. Oper. Res. Lett. 17(3), 103\u2013110 (1995)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"23_CR10","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1016\/0377-2217(94)90257-7","volume":"73","author":"HL Li","year":"1994","unstructured":"Li, H.L.: A global approach for general 0\u20131 fractional programming. European Journal of Operational Research 73(3), 590\u2013596 (1994)","journal-title":"European Journal of Operational Research"},{"issue":"4, Part 1","key":"23_CR11","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1016\/j.eswa.2013.07.107","volume":"41","author":"C Lin","year":"2014","unstructured":"Lin, C., Choy, K., Ho, G., Chung, S., Lam, H.: Survey of green vehicle routing problem: past and future trends. Expert Systems with Applications 41(4, Part 1), 1118\u20131138 (2014)","journal-title":"Expert Systems with Applications"},{"key":"23_CR12","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons (1990)"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Polyakovskiy, S., Bonyadi, M.R., Wagner, M., Michalewicz, Z., Neumann, F.: A comprehensive benchmark set and heuristics for the traveling thief problem. In: Arnold, D.V. (ed.) GECCO, pp. 477\u2013484. ACM (2014)","DOI":"10.1145\/2576768.2598249"},{"issue":"4","key":"23_CR14","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB - A traveling salesman problem library. ORSA Journal on Computing 3(4), 376\u2013384 (1991)","journal-title":"ORSA Journal on Computing"},{"key":"23_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4388-3","volume-title":"A Reformulation Linearization Technique for Solving Discrete and Continuous Nonconvex Problems","author":"H Sherali","year":"1999","unstructured":"Sherali, H., Adams, W.: A Reformulation Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. J Kluwer Academic Publishing, Boston (1999)"},{"issue":"4","key":"23_CR16","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1023\/A:1021279918708","volume":"24","author":"M Tawarmalani","year":"2002","unstructured":"Tawarmalani, M., Ahmed, S., Sahinidis, N.: Global optimization of 0\u20131 hyperbolic programs. Journal of Global Optimization 24(4), 385\u2013416 (2002)","journal-title":"Journal of Global Optimization"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18008-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,30]],"date-time":"2020-12-30T20:07:24Z","timestamp":1609358844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-18008-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319180076","9783319180083"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18008-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}