{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:45:54Z","timestamp":1709815554167},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,4,14]],"date-time":"2012-04-14T00:00:00Z","timestamp":1334361600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s10479-012-1133-2","type":"journal-article","created":{"date-parts":[[2012,4,13]],"date-time":"2012-04-13T13:26:15Z","timestamp":1334323575000},"page":"371-390","source":"Crossref","is-referenced-by-count":8,"title":["A discrete dynamic convexized method for the max-cut problem"],"prefix":"10.1007","volume":"196","author":[{"given":"Geng","family":"Lin","sequence":"first","affiliation":[]},{"given":"Wenxing","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,4,14]]},"reference":[{"key":"1133_CR1","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., & Reinelt, G. (1988). An application of combinatorial optimization to statistical physical and circuit layout design. Operational Research, 36, 493\u2013513.","journal-title":"Operational Research"},{"key":"1133_CR2","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1080\/10556789908805761","volume":"11","author":"S. Benson","year":"1999","unstructured":"Benson, S., Ye, Y., & Zhang, X. (1999). Mixed linear and semidefinite programming for combinatorial and quadratic optimization. Optimization Methods & Software, 11, 515\u2013544.","journal-title":"Optimization Methods & Software"},{"key":"1133_CR3","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1080\/10556780108805818","volume":"15","author":"S. Burer","year":"2001","unstructured":"Burer, S., & Monteiro, R. D. C. (2001). A projected gradient algorithm for solving the maxcut SDP problem. Optimization Methods & Software, 15, 175\u2013200.","journal-title":"Optimization Methods & Software"},{"key":"1133_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 relation heuristics for max-cut and other binary quadratic programs. SIAM Journal on Optimization, 12, 503\u2013521.","journal-title":"SIAM Journal on Optimization"},{"key":"1133_CR5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/TCAD.1987.1270247","volume":"6","author":"K. C. Chang","year":"1987","unstructured":"Chang, K. C., & Du, D.-Z. (1987). Efficient algorithms for layer assignment problems. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 6, 67\u201378.","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"1133_CR6","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1080\/1055678021000090033","volume":"17","author":"P. Festa","year":"2002","unstructured":"Festa, P., Pardalos, P. M., Resende, M. G. C., & Ribeiro, C. C. (2002). Randomized heuristics for max-cut problem. Optimization Methods & Software, 17, 1033\u20131058.","journal-title":"Optimization Methods & Software"},{"key":"1133_CR7","unstructured":"Festa, P., & Resende, M. G. C. (2003). CIRCUT+PR: a rank-2 heuristic with path-relinking for MAX-CUT. In Extended abstracts of the fifth metaheuristics international conference MIC2003, Kyoto, Japan."},{"key":"1133_CR8","first-page":"175","volume-title":"Proc. ACM\/IEEE DAC","author":"C. M. Fiduccia","year":"1982","unstructured":"Fiduccia, C. M., & Mattheyses, R. M. (1982). A linear time heuristic for improving network partitions. In Proc. ACM\/IEEE DAC (pp. 175\u2013181)."},{"key":"1133_CR9","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M. Garey","year":"1976","unstructured":"Garey, M., Johnson, D., & Stochmeter, L. (1976). Some simplified NP-complete graph problems. Theoretical Computer Science, 1, 237\u2013267.","journal-title":"Theoretical Computer Science"},{"key":"1133_CR10","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M. X. Goemans","year":"1995","unstructured":"Goemans, M. X., & Williams, D. P. (1995). Improved approximation algorithms for Max-Cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42, 1115\u20131145.","journal-title":"Journal of the ACM"},{"key":"1133_CR11","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/s101070100288","volume":"92","author":"Q. M. Han","year":"2002","unstructured":"Han, Q. M., Ye, Y., & Zhang, J. (2002). An improved rounding method and semidefinite programming relaxation for graph partition. Mathematical Programming, 92, 509\u2013535.","journal-title":"Mathematical Programming"},{"key":"1133_CR12","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/S1052623497328987","volume":"10","author":"C. Helmberg","year":"2000","unstructured":"Helmberg, C., & Rendl, F. (2000). A spectral bundle method for semidefinite programming. SIAM Journal on Optimization, 10, 673\u2013696.","journal-title":"SIAM Journal on Optimization"},{"key":"1133_CR13","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/s10732-005-3603-z","volume":"11","author":"H. Alperin","year":"2005","unstructured":"Alperin, H., & Nowak, I. (2005). Lagrangian smoothing heuristics for Max-Cut. Journal of Heuristics, 11, 447\u2013463.","journal-title":"Journal of Heuristics"},{"key":"1133_CR14","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"R. M. Karp","year":"1972","unstructured":"Karp, R. M. (1972). Reducibility among combinatorial problems. In R. Miller & J. Thatcher (Eds.), Complexity of computer computations (pp. 85\u2013103). New York: Plenum Press."},{"key":"1133_CR15","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1080\/10556780410001647203","volume":"19","author":"H. W. Liu","year":"2004","unstructured":"Liu, H. W., Wang, S. H., & Liu, S. Y. (2004). Feasible direction algorithm for solving SDP relaxation of the quadratic {\u22121,1} programming. Optimization Methods & Software, 19, 125\u2013136.","journal-title":"Optimization Methods & Software"},{"key":"1133_CR16","series-title":"DIMACS series in discrete mathematics and computer science","volume-title":"Special year on combinatorial optimization","author":"S. Poljak","year":"1995","unstructured":"Poljak, S., & Tuza, Z. (1995). The Max-Cut problem: a survey. In W. Cook, L. Lov\u00e0sz & P. Seymour (Eds.), DIMACS series in discrete mathematics and computer science. Special year on combinatorial optimization. Providence: Am. Math. Soc."},{"key":"1133_CR17","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1016\/j.cam.2007.09.012","volume":"220","author":"A.-F. Ling","year":"2008","unstructured":"Ling, A.-F., Xu, C.-X., & Xu, F.-M. (2008). A discrete filled function algorithm for approximate global solutions of max-cut problems. Journal of Computational and Applied Mathematics, 220, 643\u2013660.","journal-title":"Journal of Computational and Applied Mathematics"},{"key":"1133_CR18","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1016\/j.ejor.2008.07.026","volume":"197","author":"A.-F. Ling","year":"2009","unstructured":"Ling, A.-F., Xu, C.-X., & Xu, F.-M. (2009). A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems. European Journal of Operational Research, 197, 519\u2013531.","journal-title":"European Journal of Operational Research"},{"key":"1133_CR19","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sahni, S., & Gonzales, T. (1976). P-complete approximation problem. Journal of the ACM, 23, 555\u2013565.","journal-title":"Journal of the ACM"},{"key":"1133_CR20","first-page":"749","volume":"24","author":"C.-X. Xu","year":"2006","unstructured":"Xu, C.-X., He, X.-L., & Xu, F.-M. (2006). An effective continuous algorithm for approximate solutions of large scale max-cut problems. Journal of Computational Mathematics, 24, 749\u2013760.","journal-title":"Journal of Computational Mathematics"},{"key":"1133_CR21","doi-asserted-by":"crossref","first-page":"1257","DOI":"10.1007\/s10114-005-0881-1","volume":"23","author":"F.-M. Xu","year":"2007","unstructured":"Xu, F.-M., Xu, C.-X., & Li, X.-S. (2007). A continuation algorithm for Max-Cut problem. Acta Mathematica Sinica. English Series, 23, 1257\u20131264.","journal-title":"Acta Mathematica Sinica. English Series"},{"key":"1133_CR22","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1016\/j.cam.2008.01.023","volume":"223","author":"W. X. Zhu","year":"2009","unstructured":"Zhu, W. X., & Fan, H. (2009). A discrete dynamic convexized method for nonlinear integer programming. Journal of Computational and Applied Mathematics, 223, 356\u2013373.","journal-title":"Journal of Computational and Applied Mathematics"},{"key":"1133_CR23","doi-asserted-by":"crossref","first-page":"2723","DOI":"10.1016\/j.cor.2008.12.002","volume":"36","author":"W. X. Zhu","year":"2009","unstructured":"Zhu, W. X., & Ali, M. M. (2009). Discrete dynamic convexized method for nonlinear constrained integer programming. Computers & Operations Research, 36, 2723\u20132728.","journal-title":"Computers & Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1133-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-012-1133-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1133-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:09:35Z","timestamp":1559153375000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-012-1133-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,14]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["1133"],"URL":"https:\/\/doi.org\/10.1007\/s10479-012-1133-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,14]]}}}