{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T07:33:03Z","timestamp":1768203183294,"version":"3.49.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T00:00:00Z","timestamp":1749772800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T00:00:00Z","timestamp":1749772800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12361066"],"award-info":[{"award-number":["12361066"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12101593"],"award-info":[{"award-number":["12101593"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"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","award":["K264202011820"],"award-info":[{"award-number":["K264202011820"]}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12361066"],"award-info":[{"award-number":["12361066"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Project of Yunling Scholars Training of Yunnan Province","award":["K264202011820"],"award-info":[{"award-number":["K264202011820"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s11590-025-02213-5","type":"journal-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T08:35:50Z","timestamp":1749803750000},"page":"123-141","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exact combinatorial algorithms for solving the bin covering problems with strong divisibility and rejection profit"],"prefix":"10.1007","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1508-1440","authenticated-orcid":false,"given":"Jianping","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lijian","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1385-8957","authenticated-orcid":false,"given":"Junran","family":"Lichen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5713-0867","authenticated-orcid":false,"given":"Pengxiang","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,13]]},"reference":[{"issue":"1","key":"2213_CR1","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/PL00009203","volume":"21","author":"N Alon","year":"1998","unstructured":"Alon, N., Azar, Y., Csirik, J., Epstein, L., Sevastianov, S.V., Vestjens, A.P.A., Woeginger, G.J.: On-line and off-line approximation algorithms for vector covering problems. Algorithmica 21(1), 104\u2013118 (1998)","journal-title":"Algorithmica"},{"key":"2213_CR2","unstructured":"Assmann, S.F.: Problems in Discrete Applied Mathematics. Ph.D. thesis, Massachusetts Institute of Technology (1983)"},{"issue":"4","key":"2213_CR3","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1016\/0196-6774(84)90004-X","volume":"5","author":"SF Assmann","year":"1984","unstructured":"Assmann, S.F., Johnson, D.S., Kleitman, D.J., Leung, J.Y.T.: On a dual version of the one-dimensional bin packing problem. J. Algorithms 5(4), 502\u2013525 (1984)","journal-title":"J. Algorithms"},{"issue":"4","key":"2213_CR4","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10951-018-0590-0","volume":"22","author":"J Balogh","year":"2019","unstructured":"Balogh, J., Epstein, L., Levin, A.: Lower bounds for online bin covering-type problems. J. Sched. 22(4), 487\u2013497 (2019)","journal-title":"J. Sched."},{"issue":"3","key":"2213_CR5","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s00453-020-00728-0","volume":"83","author":"J Boyar","year":"2021","unstructured":"Boyar, J., Favrholdt, L.M., Kamali, S., Larsen, K.S.: Online bin covering with advice. Algorithmica 83(3), 795\u2013821 (2021)","journal-title":"Algorithmica"},{"key":"2213_CR6","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.tcs.2014.06.029","volume":"556","author":"MG Christ","year":"2014","unstructured":"Christ, M.G., Favrholdt, L.M., Larsen, K.S.: Online bin covering: expectations vs. guarantees. Theoret. Comput. Sci. 556, 71\u201384 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"2213_CR7","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":"2213_CR8","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":"2213_CR9","first-page":"87","volume":"1","author":"J Csirik","year":"1990","unstructured":"Csirik, J., Frenk, J.: A dual version of the bin packing problem. Algorithms Rev. 1, 87\u201395 (1990)","journal-title":"Algorithms Rev."},{"issue":"2","key":"2213_CR10","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0196-6774(91)90001-F","volume":"12","author":"J Csirik","year":"1991","unstructured":"Csirik, J., Frenk, J., Galambos, G., Rinnooy Kan, A.: Probabilistic analysis of algorithms for dual bin packing problems. J. Algorithms 12(2), 189\u2013203 (1991)","journal-title":"J. Algorithms"},{"issue":"1","key":"2213_CR11","first-page":"13","volume":"14","author":"J Csirik","year":"1999","unstructured":"Csirik, J., Frenk, J., Labb\u00eb, M., Zhang, S.: Two simple algorithms for bin covering. Acta Cybernet. 14(1), 13\u201325 (1999)","journal-title":"Acta Cybernet."},{"key":"2213_CR12","unstructured":"Csirik, J., Johnson, D., Kenyon, C.: Better approximation algorithms for bin covering. In: Proceedings of the 12th Annual Symposium on Discrete Algorithms, SIAM, Washington, DC, pp. 557\u2013566 (2001)"},{"issue":"1","key":"2213_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2016.04.030","volume":"255","author":"M Delorme","year":"2016","unstructured":"Delorme, M., Iori, M., Martello, S.: Bin packing and cutting stock problems: mathematical models and exact algorithms. Eur. J. Oper. Res. 255(1), 1\u201320 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"2213_CR14","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":"2","key":"2213_CR15","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1006\/inco.2001.3087","volume":"171","author":"L Epstein","year":"2001","unstructured":"Epstein, L.: Online variable sized covering. Inf. Comput. 171(2), 294\u2013305 (2001)","journal-title":"Inf. Comput."},{"issue":"2","key":"2213_CR16","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/s00224-008-9129-7","volume":"46","author":"L Epstein","year":"2010","unstructured":"Epstein, L., Imreh, C., Levin, A.: Class constrained bin covering. Theory Comput. Syst. 46(2), 246\u2013260 (2010)","journal-title":"Theory Comput. Syst."},{"key":"2213_CR17","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness (1979)"},{"issue":"1","key":"2213_CR18","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.ejor.2019.05.029","volume":"279","author":"N Goldberg","year":"2019","unstructured":"Goldberg, N., Karhi, S.: Online packing of arbitrary sized items into designated and multipurpose bins. Eur. J. Oper. Res. 279(1), 54\u201367 (2019)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"2213_CR19","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17(2), 416\u2013429 (1969)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"2213_CR20","first-page":"53","volume":"47","author":"S Jabari","year":"2016","unstructured":"Jabari, S., Moazzami, D., Ghodousian, A.: Heuristic and exact algorithms for generalized bin covering problem. J. Algorithms Comput. 47(1), 53\u201362 (2016)","journal-title":"J. Algorithms Comput."},{"issue":"1\u20133","key":"2213_CR21","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1016\/S0304-3975(03)00363-3","volume":"306","author":"K Jansen","year":"2003","unstructured":"Jansen, K., Solis-Oba, R.: An asymptotic fully polynomial time approximation scheme for bin covering. Theoret. Comput. Sci. 306(1\u20133), 543\u2013551 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"2213_CR22","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":"2nd edn"},{"key":"2213_CR23","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"},{"issue":"2","key":"2213_CR24","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/s00453-008-9202-2","volume":"57","author":"M Lin","year":"2010","unstructured":"Lin, M., Yang, Y., Xu, J.: Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems. Algorithmica 57(2), 232\u2013251 (2010)","journal-title":"Algorithmica"},{"key":"2213_CR25","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.dam.2017.05.015","volume":"229","author":"J Martinovic","year":"2017","unstructured":"Martinovic, J., Scheithauer, G.: An upper bound of $$\\Delta (E)< 3\/2$$ for skiving stock instances of the divisible case. Discret. Appl. Math. 229, 161\u2013167 (2017)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"2213_CR26","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1016\/j.ejor.2021.05.041","volume":"297","author":"X Schepler","year":"2022","unstructured":"Schepler, X., Rossi, A., Gurevsky, E., Dolgui, A.: Solving robust bin-packing problems with a branch-and-price approach. Eur. J. Oper. Res. 297(3), 831\u2013843 (2022)","journal-title":"Eur. J. Oper. Res."},{"key":"2213_CR27","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer-Verlag, Berlin (2003)"},{"issue":"2","key":"2213_CR28","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.ejor.2016.06.068","volume":"256","author":"R Walter","year":"2017","unstructured":"Walter, R., Lawrinenko, A.: Lower bounds and algorithms for the minimum cardinality bin covering problem. Eur. J. Oper. Res. 256(2), 392\u2013403 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"2213_CR29","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/j.ejor.2021.01.027","volume":"294","author":"M Witteman","year":"2021","unstructured":"Witteman, M., Deng, Q., Santos, B.F.: A bin packing approach to solve the aircraft maintenance task allocation problem. Eur. J. Oper. Res. 294(1), 365\u2013376 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"2213_CR30","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0167-6377(99)00023-1","volume":"25","author":"GJ Woeginger","year":"1999","unstructured":"Woeginger, G.J., Zhang, G.: Optimal on-line algorithms for variable-sized bin covering. Oper. Res. Lett. 25(1), 47\u201350 (1999)","journal-title":"Oper. Res. Lett."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-025-02213-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-025-02213-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-025-02213-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T04:19:48Z","timestamp":1768191588000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-025-02213-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,13]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["2213"],"URL":"https:\/\/doi.org\/10.1007\/s11590-025-02213-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,13]]},"assertion":[{"value":"23 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}