{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:58:35Z","timestamp":1763643515276},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T00:00:00Z","timestamp":1655769600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T00:00:00Z","timestamp":1655769600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s10288-022-00514-4","type":"journal-article","created":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T16:46:43Z","timestamp":1655830003000},"page":"405-419","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Integer knapsack problems with profit functions of the same value range"],"prefix":"10.1007","volume":"21","author":[{"given":"Evgeny","family":"Gurevsky","sequence":"first","affiliation":[]},{"given":"Dmitry","family":"Kopelevich","sequence":"additional","affiliation":[]},{"given":"Sergey","family":"Kovalev","sequence":"additional","affiliation":[]},{"given":"Mikhail Y.","family":"Kovalyov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,21]]},"reference":[{"issue":"5","key":"514_CR1","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","volume":"28","author":"E Balas","year":"1980","unstructured":"Balas E, Zemel E (1980) An algorithm for large zero-one knapsack problems. Oper Res 28(5):1130\u20131154","journal-title":"Oper Res"},{"issue":"4","key":"514_CR2","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M Blum","year":"1973","unstructured":"Blum M, Floyd RW, Pratt V, Rivest RL, Tarjan RE (1973) Time bounds for selection. J Comput Syst Sci 7(4):448\u2013461","journal-title":"J Comput Syst Sci"},{"issue":"3","key":"514_CR3","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1016\/S0377-2217(01)00179-5","volume":"138","author":"KM Bretthauer","year":"2002","unstructured":"Bretthauer KM, Shetty B (2002) The nonlinear knapsack problem \u2013 algorithms and applications. European J Oper Res 138(3):459\u2013472","journal-title":"European J Oper Res"},{"issue":"2","key":"514_CR4","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1016\/j.cor.2010.07.010","volume":"38","author":"C D\u2019Ambrosio","year":"2011","unstructured":"D\u2019Ambrosio C, Martello S (2011) Heuristic algorithms for the general nonlinear separable knapsack problem. Comput Oper Res 38(2):505\u2013513","journal-title":"Comput Oper Res"},{"key":"514_CR5","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.cor.2017.12.017","volume":"93","author":"C D\u2019Ambrosio","year":"2018","unstructured":"D\u2019Ambrosio C, Martello S, Mencarelli L (2018) Relaxations and heuristics for the multiple non-linear separable knapsack problem. Comput Oper Res 93:79\u201389","journal-title":"Comput Oper Res"},{"issue":"2","key":"514_CR6","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1287\/opre.5.2.266","volume":"5","author":"GB Dantzig","year":"1957","unstructured":"Dantzig GB (1957) Discrete-variable extremum problems. Oper Res 5(2):266\u2013277","journal-title":"Oper Res"},{"key":"514_CR7","volume-title":"Comput Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Comput Intractability: A Guide to the Theory of NP-Completeness. W. H, Freeman and Company, San Francisco"},{"issue":"1","key":"514_CR8","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1002\/net.22040","volume":"79","author":"E Gurevsky","year":"2022","unstructured":"Gurevsky E, Kopelevich D, Kovalev S, Kovalyov MY (2022) Min-sum controllable risk problems with concave risk functions of the same value range. Networks 79(1):105\u2013116","journal-title":"Networks"},{"issue":"5","key":"514_CR9","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/j.orl.2018.07.005","volume":"46","author":"N Halman","year":"2018","unstructured":"Halman N, Holzhauser M, Krumke SO (2018) An FPTAS for the knapsack problem with parametric weights. Oper Res Lett 46(5):487\u2013491","journal-title":"Oper Res Lett"},{"issue":"4","key":"514_CR10","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"OH Ibarra","year":"1975","unstructured":"Ibarra OH, Kim CE (1975) Fast approximation algorithms for the knapsack and sum of subset problems. J ACM 22(4):463\u2013468","journal-title":"J ACM"},{"key":"514_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Probl","author":"H Kellerer","year":"2004","unstructured":"Kellerer H, Pferschy U, Pisinger D (2004) Knapsack Probl. Springer-Verlag, Berlin Heidelberg"},{"key":"514_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-021-00474-1","author":"S Kovalev","year":"2021","unstructured":"Kovalev S (2021) Approximation issues of fractional knapsack with penalties: a note. 4OR: A Quart J Oper Res. https:\/\/doi.org\/10.1007\/s10288-021-00474-1","journal-title":"4OR: A Quart J Oper Res"},{"issue":"2","key":"514_CR13","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(2):85\u201387","journal-title":"Oper Res Lett"},{"issue":"3","key":"514_CR14","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(3):874\u2013888","journal-title":"Eur J Oper Res"},{"key":"514_CR15","unstructured":"Martello S, Toth P (1990) Knapsack Probl: Algorithms Comput Implementations. John Wiley & Sons, Chichester"},{"key":"514_CR16","doi-asserted-by":"crossref","unstructured":"Sahni S (1977) General techniques for combinatorial approximation. Oper Res 25(6):920\u2013936","DOI":"10.1287\/opre.25.6.920"},{"issue":"05","key":"514_CR17","doi-asserted-by":"publisher","first-page":"1250031","DOI":"10.1142\/S0217595912500315","volume":"29","author":"B Zhang","year":"2012","unstructured":"Zhang B, Chen B (2012) Heuristic and exact solution method for convex nonlinear knapsack problem. Asia-Pacific J Oper Res 29(05):1250031","journal-title":"Asia-Pacific J Oper Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-022-00514-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10288-022-00514-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-022-00514-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T18:03:14Z","timestamp":1695664994000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10288-022-00514-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,21]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["514"],"URL":"https:\/\/doi.org\/10.1007\/s10288-022-00514-4","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,21]]},"assertion":[{"value":"17 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2022","order":4,"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"}}]}}