{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:32:04Z","timestamp":1760711524224},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T00:00:00Z","timestamp":1177977600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2007,5]]},"DOI":"10.1007\/bf02942392","type":"journal-article","created":{"date-parts":[[2008,9,3]],"date-time":"2008-09-03T08:12:48Z","timestamp":1220429568000},"page":"299-314","source":"Crossref","is-referenced-by-count":0,"title":["Rewriting integer variables into zero-one variables: Some guidelines for the integer quadratic multi-knapsack problem"],"prefix":"10.1007","volume":"7","author":[{"given":"Dominique","family":"Quadri","sequence":"first","affiliation":[]},{"given":"Eric","family":"Soutif","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"BF02942392_CR1","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1016\/S0377-2217(97)00414-1","volume":"112","author":"A. Billionnet","year":"1999","unstructured":"Billionnet A., Faye, E. Soutif E., (1999). A new upper bound for the 0\u20131 quadratic knapsack problem.European Journal of Operational Research,112 (3), pp. 664\u2013672.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"BF02942392_CR2","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1016\/S0377-2217(01)00179-5","volume":"138","author":"K. Bretthauer","year":"2002","unstructured":"Bretthauer K., Shetty B., (2002). The nonlinear knapsack problem \u2014 algorithms and applications.European Journal of Operational Research,138 (3), pp. 459\u2013472.","journal-title":"European Journal of Operational Research"},{"key":"BF02942392_CR3","first-page":"226","volume":"1403","author":"P. Chaillou","year":"1986","unstructured":"Chaillou P., Hansen P., Mathieu Y.,(1986). Best network flow bounds for the quadratic knapsack problem.Lecture Notes in Mathematics,1403, pp. 226\u2013235.","journal-title":"Lecture Notes in Mathematics"},{"key":"BF02942392_CR4","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0167-6377(88)90041-7","volume":"7","author":"M. Djerdjour","year":"1988","unstructured":"Djerdjour M., Mathur K., Salkin H., (1988). A surrogate-based algorithm for the general quadratic multidimensional knapsack.Operations Research Letters,7, pp. 253\u2013257.","journal-title":"Operations Research Letters"},{"issue":"10","key":"BF02942392_CR5","doi-asserted-by":"crossref","first-page":"1376","DOI":"10.1287\/mnsc.20.10.1376","volume":"20","author":"B. Faaland","year":"1974","unstructured":"Faaland B.,(1974). An integer programming algorithm for portfolio selection.Management Science,20 (10), pp. 1376\u20131384.","journal-title":"Management Science"},{"key":"BF02942392_CR6","first-page":"5","volume":"4","author":"R. Foret","year":"1959","unstructured":"Foret R., (1959). Applications de l\u2019alg\u00e8bre de Boole en recherch\u00e9 op\u00e9rationnelle.Revue fran\u00e7aise d\u2019automatique d\u2019informatique et de recherche op\u00e9rationnelle,4, pp. 5\u201336.","journal-title":"Revue fran\u00e7aise d\u2019automatique d\u2019informatique et de recherche op\u00e9rationnelle"},{"issue":"4","key":"BF02942392_CR7","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/mnsc.22.4.455","volume":"22","author":"F. Glover","year":"1975","unstructured":"Glover F., (1975). Improved linear programming formulations of nonlinear integer problems.Management Science,22 (4), pp. 455\u2013460.","journal-title":"Management Science"},{"issue":"2","key":"BF02942392_CR8","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1016\/0377-2217(85)90181-X","volume":"19","author":"F. K\u00f6rner","year":"1985","unstructured":"K\u00f6rner F., (1985). Integer quadratic programming.European Journal of Operational Research,19 (2), pp. 268\u2013273.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"BF02942392_CR9","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0167-6377(83)90047-0","volume":"2","author":"K. Mathur","year":"1983","unstructured":"Mathur K., Salkin H., Morito S., (1983). A branch and search algorithm for a class of nonlinear knapsack problems.Operations Research Letters,2 (4), pp. 155\u2013160.","journal-title":"Operations Research Letters"},{"issue":"31","key":"BF02942392_CR10","first-page":"27","volume":"27","author":"Y. Nakagawa","year":"1978","unstructured":"Nakagawa Y., (1978). Optimal reliability allocation by branch and bound techniques.HE Trans. On Reliability,27 (31), pp. 27\u201335.","journal-title":"HE Trans. On Reliability"},{"issue":"3","key":"BF02942392_CR11","first-page":"1","volume":"4","author":"D. Quadri","year":"2007","unstructured":"Quadri D., Soutif E., Tolla P., (2007). Upper bounds for large scale integer quadratic multidimensional knapsack problems.International Journal of Operations Research,4 (3), pp. 1\u20139.","journal-title":"International Journal of Operations Research"},{"issue":"3","key":"BF02942392_CR12","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1287\/mnsc.29.3.273","volume":"29","author":"K. Stecke","year":"1983","unstructured":"Stecke K., (1983). Nonlinear integer production planning problems.Management Science,29 (3), pp. 273\u2013288.","journal-title":"Management Science"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02942392.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02942392\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02942392","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T20:01:17Z","timestamp":1558468877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02942392"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,5]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,5]]}},"alternative-id":["BF02942392"],"URL":"https:\/\/doi.org\/10.1007\/bf02942392","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,5]]}}}