{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T13:30:31Z","timestamp":1784295031319,"version":"3.55.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T00:00:00Z","timestamp":1154390400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optimization Letters"],"published-print":{"date-parts":[[2006,11,29]]},"DOI":"10.1007\/s11590-006-0019-0","type":"journal-article","created":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T15:27:01Z","timestamp":1154446021000},"page":"33-47","source":"Crossref","is-referenced-by-count":45,"title":["An improved linearization strategy for zero-one quadratic programming problems"],"prefix":"10.1007","volume":"1","author":[{"given":"Hanif D.","family":"Sherali","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J. Cole","family":"Smith","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,8,1]]},"reference":[{"issue":"10","key":"19_CR1","doi-asserted-by":"crossref","first-page":"1274","DOI":"10.1287\/mnsc.32.10.1274","volume":"32","author":"W.P. Adams","year":"1986","unstructured":"Adams W.P., Sherali H.D. (1986). A tight linearization and an algorithm for zero-one quadraic programming problems. Manage. Sci. 32(10):1274\u20131290","journal-title":"Manage. Sci."},{"issue":"2","key":"19_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/00207729408928968","volume":"25","author":"B. Alidaee","year":"1994","unstructured":"Alidaee B., Kochenberger G., Ahmadian A. (1994). 0-1 quadratic programming approach for the optimal solution of two scheduling problems. Int. J. Syst. Sci. 25(2):1\u2013408","journal-title":"Int. J. Syst. Sci."},{"key":"19_CR3","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/0377-2217(90)90018-7","volume":"46","author":"T. Aykin","year":"1990","unstructured":"Aykin T. (1990). On a quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. 46:409\u2013411","journal-title":"Eur. J. Oper. Res."},{"key":"19_CR4","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1137\/S1052623400382467","volume":"12","author":"S. Burer","year":"2001","unstructured":"Burer S., Monteiro R.D.C., Zhang Y. (2001). Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs. SIAM J. Optim. 12:503\u2013521","journal-title":"SIAM J. Optim."},{"issue":"2","key":"19_CR5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1287\/ijoc.11.2.125","volume":"11","author":"A. Caprara","year":"1999","unstructured":"Caprara A., Pisinger D., Toth P. (1999). Exact solution of the quadratic knapsack problem. INFORMS J. Comput. 11(2):125\u2013137","journal-title":"INFORMS J. Comput."},{"issue":"2\u20133","key":"19_CR6","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1080\/10556780512331318173","volume":"20","author":"W. Chaovalitwongse","year":"2005","unstructured":"Chaovalitwongse W., Pardalos P.M., Iasemidis L.D., Shiau D.S., Sackellares J.C. (2005). Dynamical approaches and multi-quadratic integer programming for seizure prediction. Optim. Methods Softw. 20(2\u20133):389\u2013400","journal-title":"Optim. Methods Softw."},{"key":"19_CR7","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1016\/j.orl.2004.03.005","volume":"32","author":"W. Chaovalitwongse","year":"2004","unstructured":"Chaovalitwongse W., Pardalos P.M., Prokopyev O.A. (2004). A new linearization technique for multi-quadratic 0-1 programming problems. Oper. Res. Lett. 32:517\u2013522","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"19_CR8","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1287\/mnsc.41.4.704","volume":"41","author":"P. Chardaire","year":"1995","unstructured":"Chardaire P., Sutter A. (1995). A decomposition method for quadratic zero-one programming. Manage. Sci. 41(4):704\u2013712","journal-title":"Manage. Sci."},{"key":"19_CR9","first-page":"5","volume":"1","author":"R. Fortet","year":"1959","unstructured":"Fortet R. (1959). L\u2019algebre de boole et ses applications en recherche operationnelle. Cahiers du Centre d\u2019Etudes de Recheche Operationnelle 1:5\u201336","journal-title":"Cahiers du Centre d\u2019Etudes de Recheche Operationnelle"},{"issue":"4","key":"19_CR10","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 integer programming formulations of nonlinear integer problems. Manage. Sci. 22(4):455\u2013460","journal-title":"Manage. Sci."},{"issue":"1","key":"19_CR11","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1287\/opre.21.1.156","volume":"21","author":"F. Glover","year":"1973","unstructured":"Glover F., Woolsey E. (1973). Further reduction of zero-one polynomial programming problems to zero-one linear programming problems. Oper. Res. 21(1):156\u2013161","journal-title":"Oper. Res."},{"issue":"1","key":"19_CR12","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/opre.22.1.180","volume":"22","author":"F. Glover","year":"1974","unstructured":"Glover F., Woolsey E. (1974). Converting the 0-1 polynomial programming problem to a 0-1 linear program. Oper. Res. 22(1):180\u2013182","journal-title":"Oper. Res."},{"key":"19_CR13","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1002\/net.3230190404","volume":"19","author":"M.P. Helme","year":"1989","unstructured":"Helme M.P., Magnanti T.L. (1989). Designing satellite communication networks by zero-one quadratic programming. Networks 19:427\u2013450","journal-title":"Networks"},{"issue":"1","key":"19_CR14","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1023\/A:1009877331765","volume":"5","author":"L.D. Iasemidis","year":"2001","unstructured":"Iasemidis L.D., Pardalos P.M., Sackellares J.C., Shiau D.-S. (2001). Quadratic binary programming and dynamical system approach to the predictability of epileptic seizures. J. Comb. Optim. 5(1):9\u201326","journal-title":"J. Comb. Optim."},{"issue":"1","key":"19_CR15","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s10479-005-3449-7","volume":"139","author":"G.A. Kochenberger","year":"2005","unstructured":"Kochenberger G.A., Glover F., Alidaee B., Rego C. (2005). An unconstrained quadratic binary programming approach to the vertex coloring problem. Ann. Oper. Res. 139(1):229\u2013241","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"19_CR16","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1016\/S0377-2217(98)00359-2","volume":"119","author":"A. Lodi","year":"1999","unstructured":"Lodi A., Allemand K., Liebling T.M. (1999). An evolutionary heuristic for quadratic 0-1 programming. Eur. J. Oper. Res., 119(3):662\u2013670","journal-title":"Eur. J. Oper. Res.,"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Loiola, E.M., de Abreu, N.M.M., Boaventura-Netto, P.O., Hahn, P., Querido, T.: A survey for the quadratic assignment problem. Eur. J. Oper. Res. (2006) (to appear)","DOI":"10.1016\/j.ejor.2005.09.032"},{"issue":"3","key":"19_CR18","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0377-2217(87)80007-3","volume":"32","author":"M.E. O\u2019Kelly","year":"1987","unstructured":"O\u2019Kelly M.E. (1987). A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. 32(3):393\u2013404","journal-title":"Eur. J. Oper. Res."},{"key":"19_CR19","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1023\/B:ANOR.0000039522.58036.68","volume":"131","author":"G. Palubeckis","year":"2004","unstructured":"Palubeckis G. (2004). Multistart tabu search strategies for the unconstrained binary quadratic optimization problem. Ann. Oper. Res. 131:259\u2013282","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"19_CR20","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10107-004-0529-4","volume":"101","author":"P.M. Pardalos","year":"2004","unstructured":"Pardalos P.M., Chaovalitwongse W., Iasemidis L.D., Sackellares J.C., Shiau D.-S., Carney P.R., Prokopyev O.A., Yatsenko V.A. (2004). Seizure warning algorithm based on optimization and nonlinear dynamics. Math. Program. 101(2):365\u2013385","journal-title":"Math. Program."},{"key":"19_CR21","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02247879","volume":"45","author":"P.M. Pardalos","year":"1990","unstructured":"Pardalos P.M., Rodgers G.P. (1990). Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing 45:131\u2013144","journal-title":"Computing"},{"issue":"3","key":"19_CR22","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"H.D. Sherali","year":"1990","unstructured":"Sherali H.D., Adams W.P. (1990). A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3(3):411\u2013430","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"19_CR23","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1023\/A:1018364802456","volume":"10","author":"N.V. Thoa","year":"1998","unstructured":"Thoa N.V. (1998). Global optimization techniques for solving the general quadratic integer programming problem. Comput. Optim. Appl. 10(2):149\u2013163","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"19_CR24","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1080\/00207549508930154","volume":"33","author":"S. Viswanathan","year":"1995","unstructured":"Viswanathan S. (1995). Configuring cellular manufacturing systems: A quadratic integer programming formulation and a simple interchange heuristic. Int. J. Prod. Res. 33(2):361\u2013376","journal-title":"Int. J. Prod. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-006-0019-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-006-0019-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-006-0019-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T10:33:48Z","timestamp":1683542028000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-006-0019-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8,1]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,11,29]]}},"alternative-id":["19"],"URL":"https:\/\/doi.org\/10.1007\/s11590-006-0019-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,8,1]]}}}