{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:28:25Z","timestamp":1759667305620,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:00:00Z","timestamp":1565136000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:00:00Z","timestamp":1565136000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["NSFC No.11371216","NSFC No.11771245"],"award-info":[{"award-number":["NSFC No.11371216","NSFC No.11771245"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["NSFC No.11801589"],"award-info":[{"award-number":["NSFC No.11801589"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s10878-019-00442-w","type":"journal-article","created":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T06:02:42Z","timestamp":1565157762000},"page":"1155-1179","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the approximability of the two-phase knapsack problem"],"prefix":"10.1007","volume":"38","author":[{"given":"Kameng","family":"Nip","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenbo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,7]]},"reference":[{"issue":"3","key":"442_CR1","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/S0097539700382820","volume":"35","author":"C Chekuri","year":"2005","unstructured":"Chekuri C, Khanna S (2005) A polynomial time approximation scheme for the multiple knapsack problem. SIAM J Comput 35(3):713\u2013728","journal-title":"SIAM J Comput"},{"issue":"4","key":"442_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3233524","volume":"14","author":"Lin Chen","year":"2018","unstructured":"Chen L, Zhang G (2016) Packing groups of items into multiple knapsacks. In: Ollinger N, Vollmer H (eds) STACS 2016. LIPIcs, vol\u00a047, pp 28:1\u201328:13","journal-title":"ACM Transactions on Algorithms"},{"issue":"1","key":"442_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0377-2217(87)90165-2","volume":"28","author":"K Dudzi\u0144ski","year":"1987","unstructured":"Dudzi\u0144ski K, Walukiewicz S (1987) Exact methods for the knapsack problem and its generalizations. Eur J Oper Res 28(1):3\u201321","journal-title":"Eur J Oper Res"},{"issue":"3","key":"442_CR4","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1287\/opre.29.3.612","volume":"29","author":"BH Faaland","year":"1981","unstructured":"Faaland BH (1981) The multiperiod knapsack problem. Oper Res 29(3):612\u2013616","journal-title":"Oper Res"},{"key":"442_CR5","doi-asserted-by":"crossref","unstructured":"Feige U, Vondrak J (2006) Approximation algorithms for allocation problems: improving the factor of $$1 - 1\/e$$. In: FOCS\u201906, pp 667\u2013676","DOI":"10.1109\/FOCS.2006.14"},{"issue":"4","key":"442_CR6","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"W Fernandez de la Vega","year":"1981","unstructured":"Fernandez de la Vega W, Lueker GS (1981) Bin packing can be solved within 1 + $$\\epsilon $$ in linear time. Combinatorica 1(4):349\u2013355","journal-title":"Combinatorica"},{"issue":"3","key":"442_CR7","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1287\/moor.1110.0499","volume":"36","author":"L Fleischer","year":"2011","unstructured":"Fleischer L, Goemans MX, Mirrokni Vahab S, Sviridenko M (2011) Tight approximation algorithms for maximum separable assignment problems. Math Oper Res 36(3):416\u2013431","journal-title":"Math Oper Res"},{"key":"442_CR8","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York"},{"issue":"2","key":"442_CR9","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1287\/ijoc.7.2.232","volume":"7","author":"AMA Hariri","year":"1995","unstructured":"Hariri AMA, Potts CN, Van Wassenhove LN (1995) Single machine scheduling to minimize total weighted late work. ORSA J Comput 7(2):232\u2013242","journal-title":"ORSA J Comput"},{"issue":"4","key":"442_CR10","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"OH Ibarra","year":"1975","unstructured":"Ibarra OH, Kim CE (1975) Fast approximation algorithms for the knapsack and sum of subset problems. J ACM 22(4):463\u2013468","journal-title":"J ACM"},{"issue":"4","key":"442_CR11","doi-asserted-by":"publisher","first-page":"1392","DOI":"10.1137\/080731207","volume":"39","author":"K Jansen","year":"2010","unstructured":"Jansen K (2010) Parameterized approximation scheme for the multiple knapsack problem. SIAM J Comput 39(4):1392\u20131412","journal-title":"SIAM J Comput"},{"issue":"1","key":"442_CR12","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/0377-2217(93)E0211-F","volume":"81","author":"RE Johnston","year":"1995","unstructured":"Johnston RE, Khan LR (1995) Bounds for nested knapsack problems. Eur J Oper Res 81(1):154\u2013165","journal-title":"Eur J Oper Res"},{"key":"442_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer, Berlin"},{"key":"442_CR14","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.dam.2013.02.015","volume":"165","author":"S Kosuch","year":"2014","unstructured":"Kosuch S (2014) Approximability of the two-stage stochastic knapsack problem with discretely distributed weights. Discrete Appl Math 165:192\u2013204","journal-title":"Discrete Appl Math"},{"issue":"16","key":"442_CR15","doi-asserted-by":"publisher","first-page":"1827","DOI":"10.1016\/j.dam.2010.04.006","volume":"159","author":"S Kosuch","year":"2011","unstructured":"Kosuch S, Lisser A (2011) On two-stage stochastic knapsack problems. Discrete Appl Math 159(16):1827\u20131841","journal-title":"Discrete Appl Math"},{"issue":"4","key":"442_CR16","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1287\/moor.4.4.339","volume":"4","author":"EL Lawler","year":"1979","unstructured":"Lawler EL (1979) Fast approximation algorithms for knapsack problems. Math Oper Res 4(4):339\u2013356","journal-title":"Math Oper Res"},{"issue":"1","key":"442_CR17","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1137\/0216012","volume":"16","author":"FD Murgolo","year":"1987","unstructured":"Murgolo FD (1987) An efficient approximation scheme for variable-sized bin packing. SIAM J Comput 16(1):149\u2013161","journal-title":"SIAM J Comput"},{"key":"442_CR18","doi-asserted-by":"crossref","unstructured":"Nip K, Wang Z (2013) Combination of two-machine flow shop scheduling and shortest path problems. In: Du D-Z, Zhang G (eds) COCOON 2013. LNCS, vol 7936. Springer, pp 680\u2013687","DOI":"10.1007\/978-3-642-38768-5_60"},{"issue":"1","key":"442_CR19","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/s10878-013-9670-4","volume":"29","author":"K Nip","year":"2015","unstructured":"Nip K, Wang Z, Talla NF, Leus R (2015a) A combination of flow shop scheduling and the shortest path problem. J Comb Optim 29(1):36\u201352","journal-title":"J Comb Optim"},{"key":"442_CR20","doi-asserted-by":"crossref","unstructured":"Nip K, Wang Z, Xing W (2015b) Combinations of some shop scheduling problems and the shortest path problem: complexity and approximation algorithms. In: Xu D, Du D, Du D-Z (eds) COCOON 2015. LNCS, vol 9198. Springer, pp 97\u2013108","DOI":"10.1007\/978-3-319-21398-9_8"},{"key":"442_CR21","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.tcs.2015.12.027","volume":"654","author":"K Nip","year":"2016","unstructured":"Nip K, Wang Z, Xing W (2016) A study on several combination problems of classic shop scheduling and shortest path. Theor Comput Sci 654:175\u2013187","journal-title":"Theor Comput Sci"},{"issue":"3","key":"442_CR22","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"DB Shmoys","year":"1993","unstructured":"Shmoys DB, Tardos \u00c9 (1993) An approximation algorithm for the generalized assignment problem. Math Program 62(3):461\u2013474","journal-title":"Math Program"},{"key":"442_CR23","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.tcs.2012.06.003","volume":"460","author":"Z Wang","year":"2012","unstructured":"Wang Z, Cui Z (2012) Combination of parallel machine scheduling and vertex cover. Theor Comput Sci 460:10\u201315","journal-title":"Theor Comput Sci"},{"key":"442_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735","volume-title":"The design of approximation algorithms","author":"DP Williamson","year":"2011","unstructured":"Williamson DP, Shmoys DB (2011) The design of approximation algorithms. Cambridge University Press, New York"},{"issue":"1","key":"442_CR25","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.tcs.2005.10.036","volume":"352","author":"EC Xavier","year":"2006","unstructured":"Xavier EC, Miyazawa FK (2006) Approximation schemes for knapsack problems with shelf divisions. Theor Comput Sci 352(1):71\u201384","journal-title":"Theor Comput Sci"},{"key":"442_CR26","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032701","volume-title":"Interior point algorithms: theory and analysis","author":"Y Ye","year":"1997","unstructured":"Ye Y (1997) Interior point algorithms: theory and analysis. Wiley, London"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00442-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-019-00442-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00442-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,5]],"date-time":"2020-08-05T23:15:49Z","timestamp":1596669349000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-019-00442-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,7]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["442"],"URL":"https:\/\/doi.org\/10.1007\/s10878-019-00442-w","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2019,8,7]]},"assertion":[{"value":"7 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}