{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:38:58Z","timestamp":1740145138232,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T00:00:00Z","timestamp":1672963200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T00:00:00Z","timestamp":1672963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11861075","12101593"],"award-info":[{"award-number":["11861075","12101593"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Project for Innovation Team (Cultivation) of Yunnan Province","award":["202005AE160006"],"award-info":[{"award-number":["202005AE160006"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["buctrc202219"],"award-info":[{"award-number":["buctrc202219"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Project of Yunling Scholars Training of Yunnan Province"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s11590-022-01969-4","type":"journal-article","created":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T02:02:46Z","timestamp":1672970566000},"page":"1939-1956","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1508-1440","authenticated-orcid":false,"given":"Jianping","family":"Li","sequence":"first","affiliation":[]},{"given":"Lijian","family":"Cai","sequence":"additional","affiliation":[]},{"given":"Junran","family":"Lichen","sequence":"additional","affiliation":[]},{"given":"Pengxiang","family":"Pan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,6]]},"reference":[{"issue":"4","key":"1969_CR1","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.orl.2005.06.001","volume":"34","author":"A Ceselli","year":"2006","unstructured":"Ceselli, A., Righini, G.: An optimization algorithm for a penalized knapsack problem. Oper. Res. Lett. 34(4), 394\u2013404 (2006)","journal-title":"Oper. Res. Lett."},{"key":"1969_CR2","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/0885-064X(87)90009-4","volume":"3","author":"EG Coffman","year":"1987","unstructured":"Coffman, E.G., Garey, M.R., Johnson, D.S.: Bin packing with divisible item sizes. J. Complex. 3, 406\u2013428 (1987)","journal-title":"J. Complex."},{"key":"1969_CR3","volume-title":"Approximation Algorithms","author":"EG Coffman","year":"1997","unstructured":"Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey. In: Hochbaum, D. (ed.) Approximation Algorithms. PWS Publishing Company, Boston (1997)"},{"key":"1969_CR4","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.dam.2017.11.023","volume":"253","author":"FD Croce","year":"2019","unstructured":"Croce, F.D., Pferschy, U., Scatamacchia, R.: New exact approaches and approximation results for the penalized knapsack problem. Discret. Appl. Math. 253, 122\u2013135 (2019)","journal-title":"Discret. Appl. Math."},{"key":"1969_CR5","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BFb0029568","volume-title":"Online Algorithms: the State of the Art. Lecture Notes in Computer Science","author":"J Csirik","year":"1998","unstructured":"Csirik, J., Woeginger, G.J.: On-line packing and covering problems. In: Fiat, A., Woeginger, G.J. (eds.) Online Algorithms: the State of the Art. Lecture Notes in Computer Science, pp. 147\u2013177. Springer-Verlag, New York (1998)"},{"issue":"5","key":"1969_CR6","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1016\/j.ic.2006.02.003","volume":"204","author":"G D\u00f3sa","year":"2006","unstructured":"D\u00f3sa, G., He, Y.: Bin packing problems with rejection penalties and their dual problems. Inf. Comput. 204(5), 795\u2013815 (2006)","journal-title":"Inf. Comput."},{"issue":"4","key":"1969_CR7","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/s00453-008-9188-9","volume":"56","author":"L Epstein","year":"2010","unstructured":"Epstein, L.: Bin packing with rejection revisited. Algorithmica 56(4), 505\u2013528 (2010)","journal-title":"Algorithmica"},{"issue":"6","key":"1969_CR8","doi-asserted-by":"publisher","first-page":"3121","DOI":"10.1137\/090767613","volume":"20","author":"L Epstein","year":"2010","unstructured":"Epstein, L., Levin, A.: AFPTAS results for common variants of bin packing: a new method for handling the small items. SIAM J. Optim. 20(6), 3121\u20133145 (2010)","journal-title":"SIAM J. Optim."},{"key":"1969_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman, New york (1979)"},{"issue":"4","key":"1969_CR10","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0167-6377(93)90044-H","volume":"13","author":"M Hartmann","year":"1993","unstructured":"Hartmann, M., Olmstead, T.: Solving sequential knapsack problems. Oper. Res. Lett. 13(4), 225\u2013232 (1993)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"1969_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1145\/321812.321823","volume":"21","author":"E Horowitz","year":"1974","unstructured":"Horowitz, E., Sahni, S.: Computing partitions with applications to the knapsack problem. J. Ass. Comput. Mach. 21(2), 277\u2013292 (1974)","journal-title":"J. Ass. Comput. Mach."},{"issue":"4","key":"1969_CR12","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"OH Ibarra","year":"1975","unstructured":"Ibarra, O.H., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. J. Ass. Comput. Mach. 22(4), 463\u2013468 (1975)","journal-title":"J. Ass. Comput. Mach."},{"key":"1969_CR13","doi-asserted-by":"publisher","first-page":"148C174","DOI":"10.1016\/j.ejc.2017.07.016","volume":"68","author":"K Jansen","year":"2018","unstructured":"Jansen, K., Kraft, S.E.J.: A faster FPTAS for the unbounded knapsack problem. Eur. J. Comb. 68, 148C174 (2018)","journal-title":"Eur. J. Comb."},{"issue":"2","key":"1969_CR14","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0377-2217(02)00247-3","volume":"147","author":"J Kang","year":"2003","unstructured":"Kang, J., Park, S.: Algorithms for the variable sized bin packing problem. Eur. J. Oper. Res. 147(2), 365\u2013372 (2003)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1969_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/A:1009813105532","volume":"3","author":"H Kellerer","year":"1999","unstructured":"Kellerer, H., Pferschy, U.: A new fully polynomial time approximation scheme for the knapsack problem. J. Comb. Optim. 3(1), 59\u201371 (1999)","journal-title":"J. Comb. Optim."},{"key":"1969_CR16","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.: Knapsack Problems. Springer, Berlin (2004)"},{"key":"1969_CR17","volume-title":"The Art of Computer Programming: Fundamental Algorithms","author":"DE Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming: Fundamental Algorithms, vol. 1, 2nd edn. Addison-Wesley, Reading (1973)","edition":"2"},{"key":"1969_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24488-9","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B Korte","year":"2012","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 5th edn. Springer-Verlag, Berlin (2012)","edition":"5"},{"key":"1969_CR19","doi-asserted-by":"publisher","first-page":"1587","DOI":"10.1007\/s11590-021-01803-3","volume":"16","author":"J Li","year":"2022","unstructured":"Li, J., Pan, P., Cai, L., Lichen, J., Wang, W.: Bin packing with divisible item sizes and rejection penalties. Optim. Lett. 16, 1587\u20131597 (2022)","journal-title":"Optim. Lett."},{"issue":"2","key":"1969_CR20","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/S0377-2217(99)00260-X","volume":"123","author":"S Martello","year":"2000","unstructured":"Martello, S., Pisinger, D., Toth, P.: New trends in exact algorithms for the 0\u20131 knapsack problem. Eur. J. Oper. Res. 123(2), 325\u2013332 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"1969_CR21","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, Chichester (1990)"},{"issue":"1","key":"1969_CR22","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1287\/mnsc.23.1.27","volume":"23","author":"RM Nauss","year":"1976","unstructured":"Nauss, R.M.: An efficient algorithm for the 0\u20131 knapsack problem. Manage. Sci. 23(1), 27\u201331 (1976)","journal-title":"Manage. Sci."},{"issue":"1","key":"1969_CR23","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1145\/321864.321873","volume":"22","author":"S Sahni","year":"1975","unstructured":"Sahni, S.: Approximate algorithms for the 0\u20131 knapsack problem. J. Ass. Comput. Mach. 22(1), 115\u2013124 (1975)","journal-title":"J. Ass. Comput. Mach."},{"key":"1969_CR24","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer-Verlag, Berlin (2003)"},{"key":"1969_CR25","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer-Verlag, Berlin (2001)"},{"issue":"4","key":"1969_CR26","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0020-0190(97)00061-6","volume":"62","author":"WFJ Verhaegh","year":"1997","unstructured":"Verhaegh, W.F.J., Aarts, E.H.L.: A polynomial-time algorithm for knapsack with divisible item sizes. Inf. Process. Lett. 62(4), 217\u2013221 (1997)","journal-title":"Inf. Process. Lett."},{"key":"1969_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735","volume-title":"The Design of Approximation Algorithms","author":"DP Williamson","year":"2011","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press, New York (2011)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01969-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01969-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01969-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,20]],"date-time":"2023-09-20T08:20:46Z","timestamp":1695198046000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01969-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,6]]},"references-count":27,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["1969"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01969-4","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2023,1,6]]},"assertion":[{"value":"15 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 December 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}