{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T17:31:55Z","timestamp":1777656715751,"version":"3.51.4"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,11,1]],"date-time":"2005-11-01T00:00:00Z","timestamp":1130803200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2005,11]]},"DOI":"10.1007\/s10878-005-4105-5","type":"journal-article","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T08:26:20Z","timestamp":1131870380000},"page":"239-260","source":"Crossref","is-referenced-by-count":14,"title":["Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem"],"prefix":"10.1007","volume":"10","author":[{"given":"Mhand","family":"Hifi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hedi","family":"Mhalla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Slim","family":"Sadfi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4105_CR1","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","volume":"28","author":"E. Balas","year":"1980","unstructured":"E. Balas and E. Zemel, \u201cAn algorithm for large zero-one knapsack problems,\u201d Operations Research, vol. 28, pp. 1130\u20131154, 1980.","journal-title":"Operations Research"},{"key":"4105_CR2","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":"4105_CR3","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.5.2.266","volume":"5","author":"G.B. Dantzig","year":"1957","unstructured":"G.B. Dantzig, \u201cDiscrete variable extremum problems,\u201d Operations Research, vol. 5, pp. 266\u2013277, 1957.","journal-title":"Operations Research"},{"key":"4105_CR4","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF02241754","volume":"28","author":"D. Fayard","year":"1982","unstructured":"D. Fayard and G. Plateau, \u201cAn algorithm for the solution of the 0\u20131 knapsack problem,\u201d Computing, vol. 28, pp. 269\u2013287, 1982.","journal-title":"Computing"},{"key":"4105_CR5","first-page":"147","volume":"2","author":"A. Freville","year":"1997","unstructured":"A. Freville and G. Plateau, \u201cThe 0\u20131 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":"4105_CR6","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":"4105_CR7","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1008743711658","volume":"18","author":"M. Hifi","year":"2001","unstructured":"M. Hifi, \u201cExact algorithms for large-scale unconstrained two and three staged cutting problems,\u201d Computational Optimization and Applications, vol. 18, pp. 63\u201388, 2001.","journal-title":"Computational Optimization and Applications"},{"key":"4105_CR8","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/321812.321823","volume":"21","author":"E. Horowitz","year":"1974","unstructured":"E. Horowitz and S. Sahni, \u201cComputing partitions with applications to the knapsack problem,\u201d Journal of ACM, vol. 21, pp. 277\u2013292, 1974.","journal-title":"Journal of ACM"},{"key":"4105_CR9","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations, Wiley, Chichester: England, 1990."},{"key":"4105_CR10","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1287\/mnsc.34.5.633","volume":"34","author":"S. Martello","year":"1988","unstructured":"S. Martello and P. Toth, \u201cA new algorithm for the 0\u20131 knapsack problem,\u201d Management Science, vol. 34, pp. 633\u2013644, 1988.","journal-title":"Management Science"},{"key":"4105_CR11","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0377-2217(77)90024-8","volume":"1","author":"S. Martello","year":"1977","unstructured":"S. Martello and P. Toth, \u201cAn upper bound for the zero-one knapsack problem and a branch and bound algorithm,\u201d European Journal of Operational Research, vol. 1, pp. 169\u2013175, 1977.","journal-title":"European Journal of Operational Research"},{"key":"4105_CR12","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/S0377-2217(99)00260-X","volume":"123","author":"S. Martello","year":"2000","unstructured":"S. Martello, D. Pisinger, and P. Toth, \u201cNew trends in exact algorithms for the 0\u20131 knapsack problem,\u201d European Journal of Operational Research, vol. 123, pp. 325\u2013332, 2000.","journal-title":"European Journal of Operational Research"},{"key":"4105_CR13","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/mnsc.45.3.414","volume":"45","author":"S. Martello","year":"1999","unstructured":"S. Martello, D. Pisinger, and P. Toth, \u201cDynamic Programming and strong bounds for the 0\u20131 Knapsack Problem,\u201d Management Science, vol. 45, pp. 414\u2013424, 1999.","journal-title":"Management Science"},{"key":"4105_CR14","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":"4105_CR15","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/S0377-2217(98)00120-9","volume":"114","author":"D. Pisinger","year":"1999","unstructured":"D. Pisinger, \u201cAn exact algorithm for large multiple knapsack problems,\u201d European Journal of Operational Research, vol. 114, pp. 528\u2013541, 1999.","journal-title":"European Journal of Operational Research"},{"key":"4105_CR16","doi-asserted-by":"crossref","unstructured":"D. Pisinger and P. Toth, \u201cKnapsack Problems,\u201d in D.-Z. Du and P. Pardalos (eds.), Handbook of Combinatorial Optimization, Kluwer Academic Publishers, vol. 1, 1998, pp. 299\u2013428.","DOI":"10.1007\/978-1-4613-0303-9_5"},{"key":"4105_CR17","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1287\/opre.47.4.570","volume":"47","author":"D. Pisinger","year":"1999","unstructured":"D. Pisinger, \u201cCore problems in knapsack algorithms,\u201d Operations Research, vol. 47, pp. 570\u2013575, 1999.","journal-title":"Operations Research"},{"key":"4105_CR18","unstructured":"S. Sadfi, M\u00e9thodes adaptatives et m\u00e9thodes exactes pour des probl\u00e8mes de knapsack lin\u00e9aires et non lin\u00e9aires, Thesis, LRI, Universit\u00e9 d'Orsay, 1999."},{"key":"4105_CR19","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"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-4105-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-005-4105-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-4105-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:09Z","timestamp":1559276289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-005-4105-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,11]]}},"alternative-id":["4105"],"URL":"https:\/\/doi.org\/10.1007\/s10878-005-4105-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,11]]}}}