{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T05:03:58Z","timestamp":1779080638955,"version":"3.51.4"},"reference-count":49,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2017,1,2]],"date-time":"2017-01-02T00:00:00Z","timestamp":1483315200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["Project GeoLMI"],"award-info":[{"award-number":["Project GeoLMI"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007058","name":"Northern Illinois University","doi-asserted-by":"publisher","award":["Research & Artistry Grant"],"award-info":[{"award-number":["Research & Artistry Grant"]}],"id":[{"id":"10.13039\/100007058","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Math. Softw."],"published-print":{"date-parts":[[2017,12,31]]},"abstract":"<jats:p>\n            This article presents\n            <jats:italic>BiqCrunch<\/jats:italic>\n            , an exact solver for binary quadratic optimization problems.\n            <jats:italic>BiqCrunch<\/jats:italic>\n            is a branch-and-bound method that uses an original, efficient semidefinite-optimization-based bounding procedure. It has been successfully tested on a variety of well-known combinatorial optimization problems, such as Max-Cut, Max-\n            <jats:italic>k<\/jats:italic>\n            -Cluster, and Max-Independent-Set. The code is publicly available online; a web interface and many conversion tools are also provided.\n          <\/jats:p>","DOI":"10.1145\/3005345","type":"journal-article","created":{"date-parts":[[2017,1,3]],"date-time":"2017-01-03T13:18:41Z","timestamp":1483449521000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":39,"title":["BiqCrunch"],"prefix":"10.1145","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2658-1221","authenticated-orcid":false,"given":"Nathan","family":"Krislock","sequence":"first","affiliation":[{"name":"Northern Illinois University, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00f4me","family":"Malick","sequence":"additional","affiliation":[{"name":"CNRS, Laboratory J. Kunztmann, Grenoble, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Roupin","sequence":"additional","affiliation":[{"name":"LIPN, CNRS UMR 7030, Universit\u00e9 Paris 13, Sorbonne Paris Cit\u00e9, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,1,2]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-008-0001-1"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719604"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0769-0"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1080.0270"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-012-0040-5"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01587084"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-005-0637-9"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.12.007"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0166-9"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2006.10.011"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-05078-1"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sorms.2012.08.001"},{"key":"e_1_2_1_13_1","volume-title":"Inc. Updated","author":"Bussieck M.","year":"2012"},{"key":"e_1_2_1_14_1","doi-asserted-by":"crossref","unstructured":"C. D\u2019Ambrosio and A. Lodi. 2011. Mixed integer nonlinear programming tools: A practical overview. 4OR 9 4 (2011) 329--349.  C. D\u2019Ambrosio and A. Lodi. 2011. Mixed integer nonlinear programming tools: A practical overview. 4OR 9 4 (2011) 329--349.","DOI":"10.1007\/s10288-011-0181-9"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04295-9"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2010.544308"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-006-0011-7"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-013-0676-8"},{"key":"e_1_2_1_19_1","doi-asserted-by":"crossref","unstructured":"T. Gally M. E. Pfetsch and S. Ulbrich. 2016. A Framework for Solving Mixed-Integer Semidefinite Programs. Technical Report. Technische Universit\u00e4t Darmstadt.  T. Gally M. E. Pfetsch and S. Ulbrich. 2016. A Framework for Solving Mixed-Integer Semidefinite Programs. Technical Report. Technische Universit\u00e4t Darmstadt.","DOI":"10.1080\/10556788.2017.1322081"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580072"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009898604624"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(88)90223-6"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56468-0"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-011-9980-6"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009877331765"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539868"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0594-z"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2015.07.008"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(95)00271-R"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/0617031"},{"key":"e_1_2_1_32_1","volume-title":"BOB: A Unified Platform for Implementing Branch-and-Bound Like Algorithms. Technical Report. Laboratoire Prism.","author":"Cun B. Le","year":"1995"},{"key":"e_1_2_1_33_1","unstructured":"C. Lemar\u00e9chal and F. Oustry. 1999. Semidefinite Relaxations and Lagrangian Duality with Application to Combinatorial Optimization. Rapport de Recherche 3710. INRIA.  C. Lemar\u00e9chal and F. Oustry. 1999. Semidefinite Relaxations and Lagrangian Duality with Application to Combinatorial Optimization. Rapport de Recherche 3710. INRIA."},{"key":"e_1_2_1_34_1","doi-asserted-by":"crossref","unstructured":"F. Liers M. J\u00fcnger G. Reinelt and G. Rinaldi. 2005. Computing Exact Ground States of Hard Ising Spin Glass Problems by Branch-and-Cut. Wiley-VCH Verlag GmbH 8 Co. KGaA 47--69.  F. Liers M. J\u00fcnger G. Reinelt and G. Rinaldi. 2005. Computing Exact Ground States of Hard Ising Spin Glass Problems by Branch-and-Cut. Wiley-VCH Verlag GmbH 8 Co. KGaA 47--69.","DOI":"10.1002\/3527603794.ch4"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/0801013"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-007-9161-1"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0628-6"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049669"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01100205"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581275"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-008-0235-8"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-004-4838-6"},{"key":"e_1_2_1_44_1","unstructured":"N. V. Sahinidis. 2013. BARON 12.1.0: Global Optimization of Mixed-Integer Nonlinear Programs User\u2019s Manual.  N. V. Sahinidis. 2013. BARON 12.1.0: Global Optimization of Mixed-Integer Nonlinear Programs User\u2019s Manual."},{"key":"e_1_2_1_45_1","unstructured":"R. Saigal L. Vandenberghe and H. Wolkowicz. 2000. Handbook of Semidefinite Programming. Kluwer.  R. Saigal L. Vandenberghe and H. Wolkowicz. 2000. Handbook of Semidefinite Programming. Kluwer."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1137\/0403036"},{"key":"e_1_2_1_47_1","first-page":"1","article-title":"Quadratic optimization problems","volume":"25","author":"Shor N. Z.","year":"1987","journal-title":"Soviet Journal of Computer and Systems Sciences"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0769-0_24"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009795911987"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/279232.279236"}],"container-title":["ACM Transactions on Mathematical Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3005345","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3005345","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:50Z","timestamp":1750220630000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3005345"}},"subtitle":["A Semidefinite Branch-and-Bound Method for Solving Binary Quadratic Problems"],"short-title":[],"issued":{"date-parts":[[2017,1,2]]},"references-count":49,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,12,31]]}},"alternative-id":["10.1145\/3005345"],"URL":"https:\/\/doi.org\/10.1145\/3005345","relation":{},"ISSN":["0098-3500","1557-7295"],"issn-type":[{"value":"0098-3500","type":"print"},{"value":"1557-7295","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,2]]},"assertion":[{"value":"2014-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-01-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}