{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T19:33:32Z","timestamp":1648755212182},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,2,27]],"date-time":"2014-02-27T00:00:00Z","timestamp":1393459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s10898-014-0164-4","type":"journal-article","created":{"date-parts":[[2014,2,26]],"date-time":"2014-02-26T20:16:46Z","timestamp":1393445806000},"page":"221-233","source":"Crossref","is-referenced-by-count":4,"title":["Parametric Lagrangian dual for the binary quadratic programming problem"],"prefix":"10.1007","volume":"61","author":[{"given":"Yong","family":"Xia","sequence":"first","affiliation":[]},{"given":"Wenxun","family":"Xing","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,2,27]]},"reference":[{"key":"164_CR1","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s101070100233","volume":"91","author":"K Allemand","year":"2001","unstructured":"Allemand, K., Fukuda, K., Liebling, T.M., Steiner, E.: A polynomial case of unconstrained zero-one quadratic optimization. Math. Progr. 91, 49\u201352 (2001)","journal-title":"Math. Progr."},{"key":"164_CR2","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration. Discret. Appl. Math. 65, 21\u201346 (1996)","journal-title":"Discret. Appl. Math."},{"key":"164_CR3","doi-asserted-by":"crossref","first-page":"541","DOI":"10.2307\/2303424","volume":"50","author":"RC Buck","year":"1943","unstructured":"Buck, R.C.: Partion of space. Amer. Math. Mon. 50, 541\u2013544 (1943)","journal-title":"Amer. Math. Mon."},{"key":"164_CR4","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10107-005-0637-9","volume":"109","author":"A Billionnet","year":"2007","unstructured":"Billionnet, A., Elloumi, S.: Using a mixed integer quadratic programming solver for the unconstrained quadratic 0\u20131 problem. Math. Progr. 109, 55\u201368 (2007)","journal-title":"Math. Progr."},{"key":"164_CR5","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s10878-006-9625-0","volume":"12","author":"E \u00c7ela","year":"2006","unstructured":"\u00c7ela, E., Klinz, B., Meyar, C.: Polynomially solvable cases of the constant rank unconstrained quadratic 0\u20131 programming problem. J. Combin. Optim. 12, 187\u2013215 (2006)","journal-title":"J. Combin. Optim."},{"key":"164_CR6","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0166-218X(92)90256-A","volume":"36","author":"ST Chakradhar","year":"1992","unstructured":"Chakradhar, S.T., Bushnell, M.L.: A solvable class of quadratic 0\u20131 programming. Discret. Appl. Math. 36, 233\u2013251 (1992)","journal-title":"Discret. Appl. Math."},{"key":"164_CR7","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.: A decomposition method for quadratic zero-one programming. Manag. Sci. 41, 704\u2013712 (1995)","journal-title":"Manag. Sci."},{"key":"164_CR8","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/BF01585184","volume":"62","author":"C Delorme","year":"1993","unstructured":"Delorme, C., Poljak, S.: Laplacian eigenvalues and the maximum cut problem. Math. Progr. 62, 557\u2013574 (1993)","journal-title":"Math. Progr."},{"key":"164_CR9","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.ejor.2003.04.011","volume":"166","author":"JA Ferrez","year":"2005","unstructured":"Ferrez, J.A., Fukuda, K., Liebling, T.M.: Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm. EJOR 166, 35\u201350 (2005)","journal-title":"EJOR"},{"key":"164_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman, New York (1979)"},{"key":"164_CR11","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. Assoc. Comput. Mach. 42, 1115\u20131145 (1995)","journal-title":"J. Assoc. Comput. Mach."},{"key":"164_CR12","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/s10898-007-9155-z","volume":"39","author":"GD Halikias","year":"2007","unstructured":"Halikias, G.D., Jaimoukha, I.M., Malik, U., Gungah, S.K.: New bounds on the unconstrained quadratic integer problem. J. Glob. Optim. 39, 543\u2013554 (2007)","journal-title":"J. Glob. Optim."},{"key":"164_CR13","unstructured":"Helmberg, C.: Semidefinite programming for combinatorial optimization. Technical report, Konrad-Zuse-Zentrum f $${\\rm \\ddot{u}}$$ u \u00a8 r Informationstechnik Berlin, ZIB-Report ZR-00-34 (2000)."},{"key":"164_CR14","first-page":"291","volume":"82","author":"C Helmberg","year":"1998","unstructured":"Helmberg, C., Rendl, F.: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes. Math. Progr. 82, 291\u2013315 (1998)","journal-title":"Math. Progr."},{"key":"164_CR15","volume-title":"Handbooks in Operations Research and Management Science","author":"M Laurent","year":"2005","unstructured":"Laurent, M., Rendl, F.: Semidefinite programming and integer programming. Discrete optimization. In: Aardal, K., Nemhauser, G.L., Weismantel, R. (eds.) Handbooks in Operations Research and Management Science. Elsevier, Amsterdam (2005)"},{"key":"164_CR16","volume-title":"Nonlinear Integer Programming","author":"D Li","year":"2006","unstructured":"Li, D., Sun, X.L.: Nonlinear Integer Programming. Springer, New York (2006)"},{"key":"164_CR17","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/s10898-009-9504-1","volume":"48","author":"C Lu","year":"2010","unstructured":"Lu, C., Wang, Z., Xing, W.: An improved lower bound and approximation algorithm for binary constrained quadratic programming problem. J. Glob. Optim. 48, 497\u2013508 (2010)","journal-title":"J. Glob. Optim."},{"key":"164_CR18","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/s10107-005-0692-2","volume":"107","author":"U Malik","year":"2006","unstructured":"Malik, U., Jaimoukha, I.M., Halikias, G.D., Gungah, S.K.: On the gap between the quadratic integer programming problem and its semidefinite relaxation. Math. Progr. 107, 505\u2013515 (2006)","journal-title":"Math. Progr."},{"key":"164_CR19","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1287\/mnsc.26.3.282","volume":"26","author":"RD Mcbride","year":"1980","unstructured":"Mcbride, R.D., Yormark, J.S.: An implicit enumeration algorithm for quadratic integer programming. Manag. Sci. 26, 282\u2013296 (1980)","journal-title":"Manag. Sci."},{"key":"164_CR20","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1080\/10556789808805690","volume":"9","author":"Y Nesterov","year":"1998","unstructured":"Nesterov, Y.: Semidefinite relaxation and nonconvex quadratic optimization. Optim. Methods Softw. 9, 141\u2013160 (1998)","journal-title":"Optim. Methods Softw."},{"key":"164_CR21","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01096724","volume":"4","author":"AT Phillips","year":"1994","unstructured":"Phillips, A.T., Rosen, J.B.: A quadratic assignment formulation of the molecular conformation problem. J. Glob. Optim. 4, 229\u2013241 (1994)","journal-title":"J. Glob. Optim."},{"key":"164_CR22","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1002\/net.3230050405","volume":"5","author":"JC Picard","year":"1975","unstructured":"Picard, J.C., Ratliff, H.D.: Minimum cuts and related problems. Networks 5, 357\u2013370 (1975)","journal-title":"Networks"},{"key":"164_CR23","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01100205","volume":"7","author":"S Poljak","year":"1995","unstructured":"Poljak, S., Rendl, F., Wolkowicz, H.: A recipe for semidefinite relaxation for (0, 1)-quadratic programming. J. Glob. Optim. 7, 51\u201373 (1995)","journal-title":"J. Glob. Optim."},{"key":"164_CR24","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1287\/moor.20.3.550","volume":"20","author":"S Poljak","year":"1995","unstructured":"Poljak, S., Wolkowicz, H.: Convex relaxations of (0\u20131) quadratic programming. Math. Oper. Res. 20, 550\u2013561 (1995)","journal-title":"Math. Oper. Res."},{"key":"164_CR25","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/978-3-540-72792-7_23","volume":"4513","author":"F Rendl","year":"2007","unstructured":"Rendl, F., Rinaldi, G., Wiegele, A.: Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations. Lect. Notes in Comput. Sci. 4513, 295\u2013309 (2007)","journal-title":"Lect. Notes in Comput. Sci."},{"key":"164_CR26","first-page":"1","volume":"25","author":"NZ Shor","year":"1987","unstructured":"Shor, N.Z.: Quadratic optimization problems. Sov. J. Comput. Syst. Sci. 25, 1\u201311 (1987)","journal-title":"Sov. J. Comput. Syst. Sci."},{"issue":"2","key":"164_CR27","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s10898-011-9683-4","volume":"53","author":"XL Sun","year":"2012","unstructured":"Sun, X.L., Liu, C.L., Li, D., Gao, J.J.: On duality gap in binary quadratic optimization. J. Glob. Optim. 53(2), 255\u2013269 (2012)","journal-title":"J. Glob. Optim."},{"key":"164_CR28","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L Vandenberghe","year":"1996","unstructured":"Vandenberghe, L., Boyd, S.: Semidefinite programming. SIAM Rev. 38, 49\u201395 (1996)","journal-title":"SIAM Rev."},{"issue":"4","key":"164_CR29","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1007\/s11425-012-4512-x","volume":"56","author":"Y Xia","year":"2013","unstructured":"Xia, Y.: New semidefinite programming relaxations for box constrained quadratic program. Sci. China Math. 56(4), 877\u2013886 (2013)","journal-title":"Sci. China Math."},{"key":"164_CR30","doi-asserted-by":"crossref","unstructured":"Zaslavsky, T.: Facing up to arrangements: face-count formulas for partitions of space by hyperplanes. Am. Math. Soc. 1(154), (1975)","DOI":"10.1090\/memo\/0154"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0164-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-014-0164-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0164-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T00:38:19Z","timestamp":1565224699000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-014-0164-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,27]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["164"],"URL":"https:\/\/doi.org\/10.1007\/s10898-014-0164-4","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,27]]}}}