{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T04:15:19Z","timestamp":1778559319562,"version":"3.51.4"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,3,16]],"date-time":"2012-03-16T00:00:00Z","timestamp":1331856000000},"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":[[2012,10]]},"DOI":"10.1007\/s10898-012-9881-8","type":"journal-article","created":{"date-parts":[[2012,3,15]],"date-time":"2012-03-15T10:57:56Z","timestamp":1331809076000},"page":"341-351","source":"Crossref","is-referenced-by-count":25,"title":["Canonical dual approach to solving the maximum cut problem"],"prefix":"10.1007","volume":"54","author":[{"given":"Zhenbo","family":"Wang","sequence":"first","affiliation":[]},{"given":"Shu-Cherng","family":"Fang","sequence":"additional","affiliation":[]},{"given":"David Y.","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Wenxun","family":"Xing","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,3,16]]},"reference":[{"key":"9881_CR1","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1137\/S1052623494279134","volume":"6","author":"F. Barahona","year":"1996","unstructured":"Barahona F.: Network design using cut inequalities. SIAM J. Optim. 6, 823\u2013837 (1996)","journal-title":"SIAM J. Optim."},{"key":"9881_CR2","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1287\/opre.36.3.493","volume":"36","author":"F. Barahona","year":"1988","unstructured":"Barahona F., Gr\u00f6tschel M., J\u00fcnger M., Reinelt G.: An application of combinatorial optimization to statistical physics and circuit layout design. Oper. Res. 36, 493\u2013513 (1988)","journal-title":"Oper. Res."},{"key":"9881_CR3","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1080\/10556780108805818","volume":"15","author":"S. Burer","year":"2001","unstructured":"Burer S., Monteir R.D.C.: A projected gradient algorithm for solving the maxcut SDP relaxation. Optim. Methods Softw. 15, 175\u2013200 (2001)","journal-title":"Optim. Methods Softw."},{"key":"9881_CR4","first-page":"71","volume":"79","author":"D.S. Caterina","year":"1989","unstructured":"Caterina D.S.: The cut polytope and the boolean quadric polytope. Discret. Math. 79, 71\u201375 (1989)","journal-title":"Discret. Math."},{"key":"9881_CR5","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/BF02178370","volume":"80","author":"C. De Simone","year":"1995","unstructured":"De Simone C., Diehl M., Jiinger M., Mutzel P., Reinelt G., Rinaldi G.: Exact ground states of ising spin glasses: new experimental results with a branch-and-cut algorithm. J. Stat. Phys. 80, 487\u2013496 (1995)","journal-title":"J. Stat. Phys."},{"key":"9881_CR6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.3934\/jimo.2008.4.125","volume":"4","author":"S.-C. Fang","year":"2008","unstructured":"Fang S.-C., Gao D.Y., Sheu R.-L., Wu S.-Y.: Canonical dual approach for solving 0-1 quadratic programming problems. J. Ind. Manag. Optim. 4, 125\u2013142 (2008)","journal-title":"J. Ind. Manag. Optim."},{"key":"9881_CR7","doi-asserted-by":"crossref","unstructured":"Feng, J.-M., Lin, G.-X., Sheu, R.-L., Xia, Y.: Duality and solutions for quadratic programming over single non-homogeneous quadratic constraint. J. Glob. Optim. (in press) (2011)","DOI":"10.1007\/s10898-010-9625-6"},{"key":"9881_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3176-7","volume-title":"Duality Principles in Nonconvex Systems: Theory, Methods and Applications","author":"D.Y. Gao","year":"2000","unstructured":"Gao D.Y.: Duality Principles in Nonconvex Systems: Theory, Methods and Applications. Kluwer, Dordrecht (2000)"},{"key":"9881_CR9","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1080\/02331930310001611501","volume":"52","author":"D.Y. Gao","year":"2003","unstructured":"Gao D.Y.: Perfect duality theory and complete set of solutions to a class of global optimization. Optimization 52, 467\u2013493 (2003)","journal-title":"Optimization"},{"key":"9881_CR10","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/s10898-009-9469-0","volume":"47","author":"D.Y. Gao","year":"2010","unstructured":"Gao D.Y., Ruan N.: On the solutions to quadratic minimization problems with box and integer constraints. J. Glob. Optim. 47, 463\u2013484 (2010)","journal-title":"J. Glob. Optim."},{"key":"9881_CR11","first-page":"257","volume-title":"Advances in Applied Mathematics Mathematics","author":"D.Y. Gao","year":"2009","unstructured":"Gao D.Y., Sherali H.D.: Canonical duality theory: Connection between continuum mechanics and global optimization. In: Gao, D.Y., Sherali, H.D. (eds) Advances in Applied Mathematics Mathematics, pp. 257\u2013326. Springer, Berlin (2009)"},{"key":"9881_CR12","doi-asserted-by":"crossref","unstructured":"Gao, D.Y., Watson, L.T., Easterling, D.R., Thacker, W.I., Billups, S.C.: Solving the canonical dual of box- and integer-constrained nonconvex quadratic programs via a deterministic direct search algorithm. Optim. Methods Softw. (2011). doi: 10.1080\/10556788.2011.641125","DOI":"10.1080\/10556788.2011.641125"},{"key":"9881_CR13","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"Goemans M.X., Williamson D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"9881_CR14","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/opre.13.3.388","volume":"13","author":"P.L. Hammer","year":"1965","unstructured":"Hammer P.L.: Some network flow problems solved with pseudo-boolean programming. Oper. Res. 13, 388\u2013399 (1965)","journal-title":"Oper. Res."},{"key":"9881_CR15","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R. Karp","year":"1972","unstructured":"Karp R.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"9881_CR16","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":"9881_CR17","doi-asserted-by":"crossref","first-page":"779","DOI":"10.3934\/jimo.2010.6.779","volume":"6","author":"C. Lu","year":"2010","unstructured":"Lu C., Wang Z., Xing W., Fang S.-C.: Extended canonical duality and conic programming for solving 0-1 quadratic programming problems. J. Ind. Manag. Optim. 6, 779\u2013793 (2010)","journal-title":"J. Ind. Manag. Optim."},{"key":"9881_CR18","first-page":"502","volume":"10","author":"G.I. Orlova","year":"1972","unstructured":"Orlova G.I., Dorfman Y.G.: Finding the maximum cut in a graph. Eng. Cybern. 10, 502\u2013506 (1972)","journal-title":"Eng. Cybern."},{"key":"9881_CR19","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"T.G. Reinei","year":"1991","unstructured":"Reinei T.G.: TSPLIB\u2014A traveling salesman problem library. ORSA J. Comput. 3, 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"key":"9881_CR20","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970524","volume-title":"Conjugate Duality and Optimization","author":"R.T. Rockafellar","year":"1974","unstructured":"Rockafellar R.T.: Conjugate Duality and Optimization. SIAM Publications, Philadelphia (1974)"},{"key":"9881_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9172-0","volume-title":"Lagrange-Type Functions in Constrained Non-Convex Optimization","author":"A.M. Rubinov","year":"2003","unstructured":"Rubinov A.M., Yang X.Q.: Lagrange-Type Functions in Constrained Non-Convex Optimization. Kluwer, Dordrecht (2003)"},{"key":"9881_CR22","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sahni S., Gonzalez T.: P-complete approximation problems. J. ACM 23, 555\u2013565 (1976)","journal-title":"J. ACM"},{"key":"9881_CR23","doi-asserted-by":"crossref","first-page":"213","DOI":"10.3934\/jimo.2008.4.213","volume":"4","author":"Z. Wang","year":"2008","unstructured":"Wang Z., Fang S.-C., Gao D.Y., Xing W.: Global extremal conditions for multi-integer quadratic programming. J. Ind. Manag. Optim. 4, 213\u2013225 (2008)","journal-title":"J. Ind. Manag. Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-9881-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-012-9881-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-9881-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T05:31:33Z","timestamp":1561440693000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-012-9881-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,16]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["9881"],"URL":"https:\/\/doi.org\/10.1007\/s10898-012-9881-8","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,16]]}}}