{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:35:31Z","timestamp":1759667731537,"version":"3.41.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"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":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1023\/a:1013385216761","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T21:46:14Z","timestamp":1040679974000},"page":"35-54","source":"Crossref","is-referenced-by-count":17,"title":["The Knapsack Sharing Problem: An Exact Algorithm"],"prefix":"10.1007","volume":"6","author":[{"given":"Mhand","family":"Hifi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Slim","family":"Sadfi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"389742_CR1","series-title":"Technical Report","volume-title":"Dynamic programming parallel implementation for the knapsack problem","author":"R. Andonov","year":"1993","unstructured":"R. Andonov, F. Raimbault, and P. Quinton, \u201cDynamic programming parallel implementation for the knapsack problem,\u201d IRISA, Campus de Banlieu, Rennes, France, Technical Report,PI-740,1993."},{"key":"389742_CR2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1006\/jpdc.1997.1371","volume":"45","author":"R. Andonov","year":"1997","unstructured":"R. Andonov and S. Rajopadhye, \u201cOptimal orthogonal tiling of 2-D iterations,\u201d Journal of Parallel and Distributed Computing, vol. 45, pp. 159\u2013165, 1997.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"389742_CR3","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":"389742_CR4","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":"389742_CR5","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0167-8191(90)90124-R","volume":"13","author":"G.H. Chen","year":"1990","unstructured":"G.H. Chen, M.S. Chern, and J.H. Jang, \u201cPipeline architectures for dynamic programming algorithms,\u201d Parallel Computing, vol. 13, pp.111\u2013117,1990.","journal-title":"Parallel Computing"},{"key":"389742_CR6","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1016\/0167-8191(92)90047-B","volume":"18","author":"G.H. Chen","year":"1992","unstructured":"G.H. Chen, M.S. Chern, and J.H. Jang, \u201cAn improved parallel algorithm for 0\/1 knapsack problem,\u201d Parallel Computing, vol. 18, pp.811\u2013821, 1992.","journal-title":"Parallel Computing"},{"key":"389742_CR7","volume-title":"England Working Paper","author":"P. Chu","year":"1997","unstructured":"P. Chu and J.E. Beasley, \u201cA genetic algorithm for the multidimensional knapsack problem,\u201d The management school, Imperial college, London SW 2AZ, England Working Paper, 1997."},{"key":"389742_CR8","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1090\/dimacs\/030\/09","volume":"30","author":"V.-D. Cung","year":"1997","unstructured":"V.-D. Cung, S. Dowaji, B. Le Cun, T. Mautor, and C. Roucairol, \u201cConcurrent data structures and load balancing strategies for parallel branch-and-bound\/A\u2731 algorithms,\u201d DIMACS Series in Discrete Mathematics and Theoretical Computer SCience, vol. 30, pp. 141\u2013161, 1997.","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer SCience"},{"key":"389742_CR9","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":"389742_CR10","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":"389742_CR11","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0167-5060(08)70828-8","volume":"4","author":"P.C. Gilmore","year":"1979","unstructured":"P.C. Gilmore, \u201cCutting stock, linear programming, knap sacking, dynamic programming and integer programming, some interconnections,\u201d Annals of Discrete Mathematics, vol. 4, pp. 217\u2013235, 1979.","journal-title":"Annals of Discrete Mathematics"},{"key":"389742_CR12","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/0377-2217(95)00343-6","volume":"91","author":"M. Hifi","year":"1996","unstructured":"M. Hifi and V. Zissimopoulos, \u201cA recursive exact algorithm for weighted two-dimensional cutting,\u201d European Journal of Operational Research, vol. 91, pp. 553\u2013564, 1996.","journal-title":"European Journal of Operational Research"},{"key":"389742_CR13","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0360-8352(96)00215-X","volume":"32","author":"M. Hifi","year":"1997","unstructured":"M. Hifi and R. Ouafi, \u201cBest-first search and dynamic programming methods for cutting problems: The cases of one or more stock plates,\u201d Computers and Industrial Engineering, vol. 32, pp. 187\u2013205, 1997.","journal-title":"Computers and Industrial Engineering"},{"key":"389742_CR14","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":"389742_CR15","volume-title":"Working paper","author":"B. Le Cun","year":"1995","unstructured":"B. Le Cun, C. Roucairol, and TNN Team, \u201cBOB: A unified platform for implementing branch-and-bound like algorithms,\u201d PRiSM, Universit\u00b4e deVersailles, St-Quentin-en-Yveline, 78035,Versailles, France,Working paper, 1995."},{"key":"389742_CR16","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":"389742_CR17","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 & Sons: New York,1990."},{"key":"389742_CR18","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":"389742_CR19","first-page":"145","volume":"33","author":"R. Morabito","year":"1995","unstructured":"R. Morabito and M. Arenales, \u201cPerformance of two heuristics for solving large scale two-dimensional guillotine cutting problems,\u201d INFOR, vol. 33, pp. 145\u2013155, 1995.","journal-title":"INFOR"},{"key":"389742_CR20","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":"389742_CR21","volume-title":"Discrete Optimization Algorithms","author":"M. Syslo","year":"1983","unstructured":"M. Syslo, N. Deo, and J. Kowalik, Discrete Optimization Algorithms, Prentice-Hall: New Jersey, 1983."},{"key":"389742_CR22","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":"389742_CR23","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1016\/0377-2217(95)00024-K","volume":"84","author":"J.M. Val\u00e9ro de Carvalho","year":"1995","unstructured":"J.M. Val\u00e9ro de Carvalho and A.J. Ridrigues, \u201cAn LP-based approach to a two-stage cutting stock problem,\u201d European Journal of Operational Research, vol. 84, pp. 580\u2013589,1995.","journal-title":"European Journal of Operational Research"},{"key":"389742_CR24","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"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013385216761.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1013385216761\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013385216761.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:08:15Z","timestamp":1751281695000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1013385216761"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["389742"],"URL":"https:\/\/doi.org\/10.1023\/a:1013385216761","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}