{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T19:31:07Z","timestamp":1770751867376,"version":"3.50.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2012,10,13]],"date-time":"2012-10-13T00:00:00Z","timestamp":1350086400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s10107-012-0594-z","type":"journal-article","created":{"date-parts":[[2012,10,17]],"date-time":"2012-10-17T14:08:30Z","timestamp":1350482910000},"page":"61-86","source":"Crossref","is-referenced-by-count":36,"title":["Improved semidefinite bounding procedure for solving Max-Cut problems to optimality"],"prefix":"10.1007","volume":"143","author":[{"given":"Nathan","family":"Krislock","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00f4me","family":"Malick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Roupin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,10,13]]},"reference":[{"key":"594_CR1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719604","volume-title":"LAPACK Users\u2019 Guide","author":"E Anderson","year":"1999","unstructured":"Anderson, E., Bai, Z., Bischof, C., Blackford, S., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., Sorensen, D.: LAPACK Users\u2019 Guide, 3rd edn. Society for Industrial and Applied Mathematics, Philadelphia (1999)","edition":"3"},{"key":"594_CR2","doi-asserted-by":"crossref","unstructured":"Anjos, M.F., Lasserre, J.B. (eds.): Handbook on Semidefinite, Conic and Polynomial Optimization, International Series in Operations Research & Management Science, vol.166. Springer, USA (2012)","DOI":"10.1007\/978-1-4614-0769-0"},{"key":"594_CR3","doi-asserted-by":"crossref","unstructured":"Anjos, M.F., Lasserre, J.B.: Introduction to semidefinite, conic and polynomial optimization. In: Anjos, M.F., Lasserre, J.B (eds.) Handbook on Semidefinite, Conic and Polynomial Optimization, International Series in Operations Research & Management Science, vol.166, pp. 1\u201322. Springer, USA (2012)","DOI":"10.1007\/978-1-4614-0769-0_1"},{"key":"594_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. Program. 109, 55\u201368 (2007)","journal-title":"Math. Program."},{"key":"594_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-05078-1","volume-title":"Numerical Optimization","author":"J Bonnans","year":"2003","unstructured":"Bonnans, J., Gilbert, J., Lemar\u00e9chal, C., Sagastiz\u00e1bal, C.: Numerical Optimization. Springer, Berlin (2003)"},{"key":"594_CR6","doi-asserted-by":"crossref","unstructured":"Borwein, J.M., Lewis, A.S.: Convex Analysis and Nonlinear Optimization: Theory and Examples. Springer, Berlin (2000)","DOI":"10.1007\/978-1-4757-9859-3"},{"key":"594_CR7","volume-title":"Convex Optimization","author":"S Boyd","year":"2008","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2008)"},{"issue":"5","key":"594_CR8","doi-asserted-by":"crossref","first-page":"1190","DOI":"10.1137\/0916069","volume":"16","author":"RH Byrd","year":"1995","unstructured":"Byrd, R.H., Lu, P., Nocedal, J., Zhu, C.: A limited memory algorithm for bound constrained optimization. SIAM J. Sci. Comput. 16(5), 1190\u20131208 (1995)","journal-title":"SIAM J. Sci. Comput."},{"key":"594_CR9","unstructured":"Cadoux, F., Lemar\u00e9chal, C.: Reflections on generating (disjunctive) cuts. EURO J. Comput. Optim. (Submitted, 2012)"},{"key":"594_CR10","unstructured":"Cun, B.L., Roucairol, C., The PNN Team: BOB: A Unified Platform for Implementing Branch-and-Bound Like Algorithms. Technical Report 95\/16, University of Versailles Saint-Quentin-en-Yvelines (1995)."},{"key":"594_CR11","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"6","key":"594_CR12","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. ACM 42(6), 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"594_CR13","volume-title":"Matrix Computations","author":"GH Golub","year":"1996","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. Johns Hopkins University Press, Baltimore (1996)","edition":"3"},{"key":"594_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. Program. 82, 291\u2013315 (1998)","journal-title":"Math. Program."},{"key":"594_CR15","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty, J.B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms. Springer, Heidelberg (Two volumes) (1993)","DOI":"10.1007\/978-3-662-02796-7"},{"key":"594_CR16","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations (Proceedings of Symposium, IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, 1972), pp. 85\u2013103. Plenum, New York (1972)"},{"key":"594_CR17","unstructured":"Krislock, N., Malick, J., Roupin, F.: Improved semidefinite branch-and-bound algorithm for $$k$$ -cluster (Submitted, 2012). Available online as preprint hal-00717212"},{"issue":"2\u20133","key":"594_CR18","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1006\/eujc.1996.0020","volume":"17","author":"M Laurent","year":"1996","unstructured":"Laurent, M., Poljak, S.: Gap inequalities for the cut polytope. Eur. J. Comb. 17(2\u20133), 233\u2013254 (1996)","journal-title":"Eur. J. Comb."},{"key":"594_CR19","unstructured":"Lemar\u00e9chal, C., Oustry, F.: Semidefinite Relaxations and Lagrangian Duality with Application to Combinatorial Optimization. Rapport de Recherche 3710, INRIA (1999)"},{"key":"594_CR20","doi-asserted-by":"crossref","unstructured":"Malick, J.: Spherical constraint in Boolean quadratic programming. J. Glob. Optim. 39(4) (2007)","DOI":"10.1007\/s10898-007-9161-1"},{"key":"594_CR21","unstructured":"Malick, J., Roupin, F.: On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds leading to Newton-like methods. Math. Program. B (to appear, 2012). Available online as preprint hal-00662367"},{"key":"594_CR22","doi-asserted-by":"crossref","unstructured":"Malick, J., Roupin, F.: Solving k-cluster problems to optimality using adjustable semidefinite programming bounds. Math. Program. B Special Issue Mixed Integer Nonlinear Program (to appear, 2012)","DOI":"10.1007\/s10107-012-0604-1"},{"issue":"1","key":"594_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2049662.2049669","volume":"38","author":"JL Morales","year":"2011","unstructured":"Morales, J.L., Nocedal, J.: Remark on \u201cAlgorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization\u201d. ACM Trans. Math. Softw. 38(1), 1\u20134 (2011)","journal-title":"ACM Trans. Math. Softw."},{"key":"594_CR24","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, Berlin (2006)","edition":"2"},{"key":"594_CR25","doi-asserted-by":"crossref","unstructured":"Palagi, L., Piccialli, V., Rendl, F., Rinaldi, G., Wiegele, A.: Computational approaches to Max-Cut. In: Anjos, M.F., Lasserre, J.B. (eds.) Handbook on Semidefinite, Conic and Polynomial Optimization, International Series in Operations Research& Management Science, vol.166, pp. 821\u2013847. Springer, USA (2012)","DOI":"10.1007\/978-1-4614-0769-0_28"},{"key":"594_CR26","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/BF02247879","volume":"45","author":"P Pardalos","year":"1990","unstructured":"Pardalos, P., Rodgers, G.: Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing 45, 134\u2013144 (1990)","journal-title":"Computing"},{"key":"594_CR27","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF00120662","volume":"1","author":"PM Pardalos","year":"1991","unstructured":"Pardalos, P.M., Vavasis, S.A.: Quadratic programming with one negative eigenvalue is NP-hard. J. Glob. Optim. 1, 15\u201322 (1991)","journal-title":"J. Glob. Optim."},{"key":"594_CR28","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":"594_CR29","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10107-008-0235-8","volume":"121","author":"F Rendl","year":"2010","unstructured":"Rendl, F., Rinaldi, G., Wiegele, A.: Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations. Math. Program. 121, 307\u2013335 (2010)","journal-title":"Math. Program."},{"key":"594_CR30","unstructured":"Wiegele, A.: Nonlinear Optimization Techniques Applied to Combinatorial Optimization Problems. Ph.D. thesis, Alpen-Adria-Universit\u00e4t Klagenfurt (2006)"},{"key":"594_CR31","unstructured":"Wiegele, A.: Biq Mac Library\u2013A collection of Max-Cut and quadratic 0\u20131 programming instances of medium size. Technical report, Alpen-Adria-Universit\u00e4t Klagenfurt, Klagenfurt, Austria (2007)"},{"issue":"4","key":"594_CR32","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1145\/279232.279236","volume":"23","author":"C Zhu","year":"1997","unstructured":"Zhu, C., Byrd, R.H., Lu, P., Nocedal, J.: Algorithm 778: L-BFGS-B: fortran subroutines for large-scale bound-constrained optimization. ACM Trans. Math. Softw. 23(4), 550\u2013560 (1997)","journal-title":"ACM Trans. Math. Softw."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0594-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-012-0594-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0594-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T15:24:53Z","timestamp":1562253893000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-012-0594-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,13]]},"references-count":32,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["594"],"URL":"https:\/\/doi.org\/10.1007\/s10107-012-0594-z","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,13]]}}}