{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:40:01Z","timestamp":1752378001937,"version":"3.41.2"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1023\/a:1019920507008","type":"journal-article","created":{"date-parts":[[2003,3,15]],"date-time":"2003-03-15T08:06:10Z","timestamp":1047715570000},"page":"27-45","source":"Crossref","is-referenced-by-count":12,"title":["An Efficient Algorithm for the Knapsack Sharing Problem"],"prefix":"10.1007","volume":"23","author":[{"given":"Mhand","family":"Hifi","sequence":"first","affiliation":[]},{"given":"Slim","family":"Sadfi","sequence":"additional","affiliation":[]},{"given":"Abdelkader","family":"Sbihi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5093446_CR1","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1287\/opre.27.2.341","volume":"27","author":"J.R. Brown","year":"1979","unstructured":"J.R. Brown, \u201cThe knapsack sharing,\u201d Operations Research, vol. 27, pp. 341\u2013355, 1979.","journal-title":"Operations Research"},{"key":"5093446_CR2","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF01586926","volume":"51","author":"J.R. Brown","year":"1991","unstructured":"J.R. Brown, \u201cSolving knapsack sharing with general tradeoff functions,\u201d Mathematical Programming, vol. 51, pp. 55\u201373, 1991.","journal-title":"Mathematical Programming"},{"key":"5093446_CR3","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"P. Chu","year":"1998","unstructured":"P. Chu and J.E. Beasley, \u201cA genetic algorithm for the multidimensional knapsack problem,\u201d Journal of Heuristics, vol. 4, pp. 63\u201386, 1998.","journal-title":"Journal of Heuristics"},{"key":"5093446_CR4","first-page":"147","volume":"2","author":"A. Freville","year":"1997","unstructured":"A. Freville and G. Plateau, \u201cThe 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool,\u201d Journal of Heuristics, vol. 2, pp. 147\u2013167, 1997.","journal-title":"Journal of Heuristics"},{"key":"5093446_CR5","first-page":"879","volume":"13","author":"P.C. Gilmore","year":"1966","unstructured":"P.C. Gilmore and R.E. Gomory, \u201cThe theory and computation of knapsack functions,\u201d Operations Research, vol. 13, pp. 879\u2013919, 1966.","journal-title":"Operations Research"},{"key":"5093446_CR6","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F. Glover","year":"1986","unstructured":"F. Glover, \u201cFuture paths for integer programming and links to artificial intelligence,\u201d Computers and Operations Research, vol. 13, pp. 533\u2013549, 1986.","journal-title":"Computers and Operations Research"},{"key":"5093446_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"F. Glover and M. Laguna, Tabu Search, Kluwer Academic Publishers: Boston, MA, 1997."},{"key":"5093446_CR8","unstructured":"P. Hansen, \u201cThe steepest ascent mildest descent heuristic for combinatorial programming,\u201d Presented at the Congress on Numerical Methods in Combinatorial Optimization, Capri, Italy, 1986."},{"key":"5093446_CR9","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1023\/A:1013385216761","volume":"6","author":"M. Hifi","year":"2002","unstructured":"M. Hifi and S. Sadfi, \u201cThe knapsack sharing problem: An exact algorithm,\u201d Journal of Combinatorial Optimization, vol. 6, pp. 35\u201345, 2002.","journal-title":"Journal of Combinatorial Optimization"},{"key":"5093446_CR10","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0167-6377(91)90082-Z","volume":"10","author":"T. Kuno","year":"1991","unstructured":"T. Kuno, H. Konno, and E. Zemel, \u201cA linear-time algorithm for solving continuous maximum knapsack problems,\u201d Operations Research Letters, vol. 10, pp. 23\u201326, 1991.","journal-title":"Operations Research Letters"},{"key":"5093446_CR11","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/0377-2217(92)90335-7","volume":"60","author":"H. Luss","year":"1992","unstructured":"H. Luss, \u201cMinmax resource allocation problems: Optimization and parametric analysis,\u201d European Journal of Operational Research, vol. 60, pp. 76\u201386, 1992.","journal-title":"European Journal of Operational Research"},{"key":"5093446_CR12","volume-title":"Knapsack Problems: Algorithms and Computer Implementation","author":"S. Martello","year":"1990","unstructured":"S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementation, John Wiley: New York, 1990."},{"key":"5093446_CR13","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1287\/opre.45.5.768","volume":"45","author":"S. Martello","year":"1997","unstructured":"S. Martello and P. Toth, \u201cUpper bounds and algorithms for hard 0-1 knapsack problems,\u201d Operations Research, vol. 45, pp. 768\u2013778, 1997.","journal-title":"Operations Research"},{"key":"5093446_CR14","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0377-2217(89)90387-1","volume":"41","author":"J.S. Pang","year":"1989","unstructured":"J.S. Pang and C.S. Yu, \u201cA min-max resource allocation problem with substitutions,\u201d European Journal of Operational Research, vol. 41, pp. 218\u2013223, 1989.","journal-title":"European Journal of Operational Research"},{"key":"5093446_CR15","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1287\/opre.45.5.758","volume":"45","author":"D. Pisinger","year":"1997","unstructured":"D. Pisinger, \u201cA minimal algorithm for the 0-1 knapsack problem,\u201d Operations Research, vol. 45, pp. 758\u2013767, 1997.","journal-title":"Operations Research"},{"key":"5093446_CR16","unstructured":"M. Syslo, N. Deo, and J. Kowalik, Discrete Optimization Algorithms, Prentice-Hall, 1983."},{"key":"5093446_CR17","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1287\/opre.36.2.359","volume":"36","author":"C.S. Tang","year":"1988","unstructured":"C.S. Tang, \u201cA max-min allocation problem: Its solutions and applications,\u201d Operations Research, vol. 36, pp. 359\u2013367, 1988.","journal-title":"Operations Research"},{"key":"5093446_CR18","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1016\/S0305-0548(97)00009-9","volume":"24","author":"T. Yamada","year":"1997","unstructured":"T. Yamada and M. Futakawa, \u201cHeuristic and reduction algorithms for the knapsack sharing problem,\u201d Computers and Operations Research, vol. 24, pp. 961\u2013967, 1997.","journal-title":"Computers and Operations Research"},{"key":"5093446_CR19","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0377-2217(97)00165-3","volume":"106","author":"T. Yamada","year":"1998","unstructured":"T. Yamada, M. Futakawa, and S. Kataoka, \u201cSome exact algorithms for the knapsack sharing problem,\u201d European Journal of Operational Research, vol. 106, pp. 177\u2013183, 1998.","journal-title":"European Journal of Operational Research"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019920507008.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1019920507008\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019920507008.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:13:24Z","timestamp":1752376404000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1019920507008"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["5093446"],"URL":"https:\/\/doi.org\/10.1023\/a:1019920507008","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}