{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,5]],"date-time":"2024-08-05T23:48:44Z","timestamp":1722901724851},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,9,28]],"date-time":"2012-09-28T00:00:00Z","timestamp":1348790400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s10100-012-0269-0","type":"journal-article","created":{"date-parts":[[2012,9,28]],"date-time":"2012-09-28T09:02:12Z","timestamp":1348822932000},"page":"805-816","source":"Crossref","is-referenced-by-count":4,"title":["Bin covering with a general profit function: approximability results"],"prefix":"10.1007","volume":"21","author":[{"given":"Attila","family":"Benk\u0151","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gy\u00f6rgy","family":"D\u00f3sa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,9,28]]},"reference":[{"key":"269_CR1","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/s10951-009-0116-x","volume":"12","author":"EI Asgeirsson","year":"2009","unstructured":"Asgeirsson EI, Stein C (2009) Bounded-space online bin cover. J Sched 12:461\u2013474","journal-title":"J Sched"},{"key":"269_CR2","doi-asserted-by":"crossref","unstructured":"Benk\u0151 A, D\u00f3sa Gy, Tuza Zs. (2010) Bin Packing\/Covering with Delivery, solved with the evolution of algorithms. In: IEEE fifth international conference on bio-inspired computing: theories and applications (BIC-TA 2010), Changsha, China, pp 298\u2013302, 23\u201326 September 2010","DOI":"10.1109\/BICTA.2010.5645312"},{"key":"269_CR3","unstructured":"D\u00f3sa Gy, Tuza Zs (2011) Bin Packing\/Covering with Delivery: some variations, theoretical results and efficient offline algorithms. arXiv:1207.5672v1, unpublished manuscript"},{"key":"269_CR4","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. W. H. Freeman and Co., New York"},{"key":"269_CR5","unstructured":"Hellwig M, Suoza A (2011) Approximation algorithms for variable-sized and generalized bin covering. http:\/\/arxiv.org\/abs\/1109.3544"},{"key":"269_CR6","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.1016\/j.ejor.2006.09.059","volume":"182","author":"W Zhong","year":"2007","unstructured":"Zhong W, D\u00f3sa G, Tan Z (2007) On the machine scheduling problem with job delivery coordination. Eur J Oper Res 182:1057\u20131072","journal-title":"Eur J Oper Res"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-012-0269-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-012-0269-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-012-0269-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T08:17:33Z","timestamp":1562228253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-012-0269-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,28]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["269"],"URL":"https:\/\/doi.org\/10.1007\/s10100-012-0269-0","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,28]]}}}