{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T19:07:24Z","timestamp":1695668844240},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,2,23]],"date-time":"2021-02-23T00:00:00Z","timestamp":1614038400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,23]],"date-time":"2021-02-23T00:00:00Z","timestamp":1614038400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s10288-021-00474-1","type":"journal-article","created":{"date-parts":[[2021,2,23]],"date-time":"2021-02-23T14:24:32Z","timestamp":1614090272000},"page":"209-216","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximation issues of fractional knapsack with penalties: a note"],"prefix":"10.1007","volume":"20","author":[{"given":"Sergey","family":"Kovalev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,23]]},"reference":[{"issue":"1\u20132","key":"474_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1111\/j.1475-3995.2011.00811.x","volume":"19","author":"C Archetti","year":"2012","unstructured":"Archetti C, Speranza MG (2012) Vehicle routing problems with split deliveries. Int Trans Oper Res 19(1\u20132):3\u201322","journal-title":"Int Trans Oper Res"},{"key":"474_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2013.12.008","volume":"46","author":"M Casazza","year":"2014","unstructured":"Casazza M, Ceselli A (2014) Mathematical programming algorithms for bin packing problems with item fragmentation. Comput Oper Res 46:1\u201311","journal-title":"Comput Oper Res"},{"key":"474_CR3","doi-asserted-by":"publisher","first-page":"2087","DOI":"10.1016\/S0305-0548(02)00065-5","volume":"29","author":"TCE Cheng","year":"2002","unstructured":"Cheng TCE, Kovalyov MY (2002) An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note. Comput Oper Res 29:2087\u20132091","journal-title":"Comput Oper Res"},{"issue":"6","key":"474_CR4","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1287\/opre.51.6.922.24914","volume":"51","author":"R Freling","year":"2003","unstructured":"Freling R, Romeijn E, Morales DR, Wagelmans A (2003) A branch and price algorithm for the multi-period single-sourcing problem. Oper Res 51(6):922\u2013939","journal-title":"Oper Res"},{"issue":"2","key":"474_CR5","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10951-013-0321-5","volume":"17","author":"SPY Fung","year":"2014","unstructured":"Fung SPY (2014) Online scheduling with preemption or non-completion penalties. J Sched 17(2):173\u2013183","journal-title":"J Sched"},{"key":"474_CR6","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., San Francisco"},{"key":"474_CR7","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0167-6377(95)91591-Z","volume":"17","author":"MY Kovalyov","year":"1995","unstructured":"Kovalyov MY (1995) Improving the complexities of approximation algorithms for optimization problems. Oper Res Lett 17:85\u201387","journal-title":"Oper Res Lett"},{"issue":"4","key":"474_CR8","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1023\/B:JOSH.0000031424.35504.c4","volume":"7","author":"Z Liu","year":"2004","unstructured":"Liu Z, Cheng TCE (2004) Minimizing total completion time subject to job release dates and preemption penalties. J Sched 7(4):313\u2013327","journal-title":"J Sched"},{"issue":"6","key":"474_CR9","doi-asserted-by":"publisher","first-page":"2966","DOI":"10.1109\/TIT.2016.2555847","volume":"62","author":"X Liu","year":"2016","unstructured":"Liu X, Draper SC (2016) The ADMM penalized decoder for LDPC codes. IEEE Trans Inf Theory 62(6):2966\u20132984","journal-title":"IEEE Trans Inf Theory"},{"key":"474_CR10","doi-asserted-by":"publisher","first-page":"2130","DOI":"10.1287\/mnsc.1110.1416","volume":"57","author":"A Lodi","year":"2011","unstructured":"Lodi A, Martello S, Monaci M, Cicconetti C, Lenzini L, Mingozzi E, Eklund C, Moilanen J (2011) Efficient two-dimensional packing algorithms for mobile WiMAX. Manag Sci 57:2130\u20132144","journal-title":"Manag Sci"},{"key":"474_CR11","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.omega.2013.08.007","volume":"47","author":"E Malaguti","year":"2014","unstructured":"Malaguti E, Dur\u00e1n RM, Toth P (2014) Approaches to real world two-dimensional cutting problems. Omega 47:99\u2013115","journal-title":"Omega"},{"key":"474_CR12","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1016\/j.ejor.2018.09.020","volume":"273","author":"E Malaguti","year":"2019","unstructured":"Malaguti E, Monaci M, Paronuzzi P, Pferschy U (2019) Integer optimization with penalized fractional values: the knapsack case. Eur J Oper Res 273:874\u2013888","journal-title":"Eur J Oper Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-021-00474-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10288-021-00474-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-021-00474-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,27]],"date-time":"2022-05-27T13:08:34Z","timestamp":1653656914000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10288-021-00474-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,23]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["474"],"URL":"https:\/\/doi.org\/10.1007\/s10288-021-00474-1","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,23]]},"assertion":[{"value":"27 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The author declares that he has no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}