{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:39:51Z","timestamp":1740145191957,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T00:00:00Z","timestamp":1632182400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T00:00:00Z","timestamp":1632182400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11861075"],"award-info":[{"award-number":["11861075"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013047","name":"Cultivating Plan Program for the Leader in Science and Technology of Yunnan Province","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100013047","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008871","name":"Yunnan Provincial Science and Technology Department","doi-asserted-by":"publisher","award":["2018FY001014"],"award-info":[{"award-number":["2018FY001014"]}],"id":[{"id":"10.13039\/501100008871","id-type":"DOI","asserted-by":"publisher"}]},{"name":"IRTSTYN","award":["IRTSTYN"],"award-info":[{"award-number":["IRTSTYN"]}]},{"DOI":"10.13039\/501100007846","name":"Yunnan Provincial Department of Education","doi-asserted-by":"publisher","award":["2020Y0040"],"award-info":[{"award-number":["2020Y0040"]}],"id":[{"id":"10.13039\/501100007846","id-type":"DOI","asserted-by":"publisher"}]},{"name":"project of yunling scholars training of yunnan province"},{"name":"project of doctorial fellow award of yunnan province","award":["2018010514"],"award-info":[{"award-number":["2018010514"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s11590-021-01803-3","type":"journal-article","created":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T10:29:38Z","timestamp":1632220178000},"page":"1587-1597","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bin packing with divisible item sizes and rejection penalties"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1508-1440","authenticated-orcid":false,"given":"Jianping","family":"Li","sequence":"first","affiliation":[]},{"given":"Pengxiang","family":"Pan","sequence":"additional","affiliation":[]},{"given":"Lijian","family":"Cai","sequence":"additional","affiliation":[]},{"given":"Junran","family":"Lichen","sequence":"additional","affiliation":[]},{"given":"Wencheng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,21]]},"reference":[{"key":"1803_CR1","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":"1803_CR2","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":"1803_CR3","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2009)"},{"key":"1803_CR4","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, New York (1998)"},{"issue":"11","key":"1803_CR5","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/j.ipl.2009.02.003","volume":"109","author":"P Detti","year":"2009","unstructured":"Detti, P.: A polynomial algorithm for the multiple knapsack problem with divisible item sizes. Inf. Process. Lett. 109(11), 582\u2013584 (2009)","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"1803_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":"1803_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":"1803_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."},{"issue":"4","key":"1803_CR9","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, G.S.: Bin packing can be solved within 1+$$\\varepsilon $$ in linear time. Combinatorica 1(4), 349\u2013355 (1981)","journal-title":"Combinatorica"},{"key":"1803_CR10","unstructured":"Johnson, D.S.: Near-Optimal Bin Packing Algorithms. Ph.D. Thesis, MIT, Department of Mathematics, Cambridge (1973)"},{"key":"1803_CR11","doi-asserted-by":"crossref","unstructured":"Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 312\u2013320. IEEE, New York (1982)","DOI":"10.1109\/SFCS.1982.61"},{"key":"1803_CR12","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, MA (1973)","edition":"2"},{"key":"1803_CR13","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, Berlin (2012)","edition":"5"},{"key":"1803_CR14","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)"},{"key":"1803_CR15","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1002\/1520-6750(199406)41:4<579::AID-NAV3220410409>3.0.CO;2-G","volume":"41","author":"D Simchi-Levi","year":"1994","unstructured":"Simchi-Levi, D.: New worst-case results for the bin packing problem. Nav. Res. Logist. 41, 579\u2013585 (1994)","journal-title":"Nav. Res. Logist."},{"key":"1803_CR16","unstructured":"Ullman, J.D.: The performance of a memory allocation algorithm. Technical Report 100, Princeton University, Princeton, NJ (1971)"},{"key":"1803_CR17","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Berlin (2001)"},{"key":"1803_CR18","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)"},{"key":"1803_CR19","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0167-6377(99)00077-2","volume":"26","author":"G Zhang","year":"2000","unstructured":"Zhang, G., Cai, X., Wong, C.K.: Linear time approximation algorithms for bin packing. Oper. Res. Lett. 26, 217\u2013222 (2000)","journal-title":"Oper. Res. Lett."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01803-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01803-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01803-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:18:37Z","timestamp":1652199517000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01803-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,21]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["1803"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01803-3","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2021,9,21]]},"assertion":[{"value":"31 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}