{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:43:30Z","timestamp":1725900210156},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385261"},{"type":"electronic","value":"9783642385278"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38527-8_23","type":"book-chapter","created":{"date-parts":[[2013,5,8]],"date-time":"2013-05-08T13:23:02Z","timestamp":1368019382000},"page":"248-259","source":"Crossref","is-referenced-by-count":2,"title":["Hybrid SDP Bounding Procedure"],"prefix":"10.1007","author":[{"given":"Fabio","family":"Furini","sequence":"first","affiliation":[]},{"given":"Emiliano","family":"Traversi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2-3","key":"23_CR1","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10898-008-9372-0","volume":"43","author":"K.M. Anstreicher","year":"2009","unstructured":"Anstreicher, K.M.: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J. Global Optim.\u00a043(2-3), 471\u2013484 (2009)","journal-title":"J. Global Optim."},{"key":"23_CR2","unstructured":"BARON (2012), \n                    \n                      http:\/\/archimedes.cheme.cmu.edu\/?q=baron"},{"key":"23_CR3","unstructured":"BiqCrunch (2012), \n                    \n                      http:\/\/www-lipn.univ-paris13.fr\/BiqCrunch\/"},{"key":"23_CR4","unstructured":"Bonmin (2012), \n                    \n                      https:\/\/projects.coin-or.org\/Bonmin"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1080\/10556789908805765","volume":"11","author":"B. Borchers","year":"1999","unstructured":"Borchers, B.: CSDP, A C library for semidefinite programming. Optim. Methods Softw.\u00a011, 613\u2013623 (1999)","journal-title":"Optim. Methods Softw."},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10589-007-9137-6","volume":"43","author":"S. Burer","year":"2009","unstructured":"Burer, S., Vandenbussche, D.: Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound. Comp. Optim. Appl.\u00a043, 181\u2013195 (2009)","journal-title":"Comp. Optim. Appl."},{"key":"23_CR7","unstructured":"Cplex (2012), \n                    \n                      http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimizer\/"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-642-20807-2_18","volume-title":"Integer Programming and Combinatoral Optimization","author":"M. Giandomenico","year":"2011","unstructured":"Giandomenico, M., Letchford, A.N., Rossi, F., Smriglio, S.: A new approach to the stable set problem based on ellipsoids. In: G\u00fcnl\u00fck, O., Woeginger, G.J. (eds.) IPCO 2011. LNCS, vol.\u00a06655, pp. 223\u2013234. Springer, Heidelberg (2011)"},{"key":"23_CR9","unstructured":"Gurobi (2012), \n                    \n                      http:\/\/www.gurobi.com\/"},{"key":"23_CR10","unstructured":"Jaumard, B., Marcotte, O., Meyer, C.: Estimation of the Quality of Cellular Networks Using Column Generation Techniques. Cahiers du G\u00c9RAD (1998)"},{"issue":"1-3","key":"23_CR11","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0166-218X(00)00317-6","volume":"112","author":"B. Jaumard","year":"2001","unstructured":"Jaumard, B., Marcotte, O., Meyer, C., Vovor, T.: Comparison of column generation models for channel assignment in cellular networks. Discrete Appl. Math.\u00a0112(1-3), 217\u2013240 (2001)","journal-title":"Discrete Appl. Math."},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Krislock, N., Malick, J., Roupin, F.: Improved semidefinite bounding procedure for solving max-cut problems to optimality. To appear in Math. Prog. (2013)","DOI":"10.1007\/s10107-012-0594-z"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Mahdavi Pajouh, F., Balasundaram, B., Prokopyev, O.: On characterization of maximal independent sets via quadratic optimization. J. Heuristics, 1\u201316 (2011)","DOI":"10.1007\/s10732-011-9171-5"},{"key":"23_CR14","doi-asserted-by":"publisher","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. Prog.\u00a0121, 307\u2013335 (2010)","journal-title":"Math. Prog."},{"key":"23_CR15","unstructured":"SeDuMi (2012), \n                    \n                      http:\/\/sedumi.ie.lehigh.edu\/"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Springer (1998)","DOI":"10.1007\/978-1-4757-4388-3"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38527-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T23:48:27Z","timestamp":1557704907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38527-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385261","9783642385278"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38527-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}