{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T17:04:41Z","timestamp":1779555881369,"version":"3.53.1"},"reference-count":23,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T00:00:00Z","timestamp":1775865600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000147","name":"NSF CMMI","doi-asserted-by":"publisher","award":["2211343"],"award-info":[{"award-number":["2211343"]}],"id":[{"id":"10.13039\/100000147","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.orl.2026.107446","type":"journal-article","created":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T15:54:09Z","timestamp":1774972449000},"page":"107446","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Extreme strong branching for QCQPs"],"prefix":"10.1016","volume":"67","author":[{"given":"Santanu S.","family":"Dey","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-5782-6278","authenticated-orcid":false,"given":"Dahye","family":"Han","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1031-9491","authenticated-orcid":false,"given":"Yang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.orl.2026.107446_bib0001","series-title":"Finding Cuts in the TSP (A Preliminary Report)","volume":"95","author":"Applegate","year":"1995"},{"issue":"1","key":"10.1016\/j.orl.2026.107446_bib0002","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","article-title":"Branching rules revisited","volume":"33","author":"Achterberg","year":"2005","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"10.1016\/j.orl.2026.107446_bib0003","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10107-023-01977-x","article-title":"A theoretical and computational analysis of full strong-branching","volume":"205","author":"Dey","year":"2024","journal-title":"Math. Program."},{"issue":"4-5","key":"10.1016\/j.orl.2026.107446_bib0004","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/S0098-1354(98)00286-5","article-title":"A symbolic reformulation\/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs","volume":"23","author":"Smith","year":"1999","journal-title":"Comput. Chem. Eng."},{"issue":"3","key":"10.1016\/j.orl.2026.107446_bib0005","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","article-title":"Global optimization of mixed-integer nonlinear programs: a theoretical and computational study","volume":"99","author":"Tawarmalani","year":"2004","journal-title":"Math. Program."},{"issue":"2","key":"10.1016\/j.orl.2026.107446_bib0006","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s10107-005-0582-7","article-title":"A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs","volume":"103","author":"Linderoth","year":"2005","journal-title":"Math. Program."},{"issue":"2","key":"10.1016\/j.orl.2026.107446_bib0007","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/s10107-016-1095-2","article-title":"A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables","volume":"165","author":"Chen","year":"2017","journal-title":"Math. Program."},{"issue":"2","key":"10.1016\/j.orl.2026.107446_bib0008","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1016\/j.ejor.2019.09.043","article-title":"A branch-and-cut algorithm for mixed-integer bilinear programming","volume":"282","author":"Fischetti","year":"2020","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"10.1016\/j.orl.2026.107446_bib0009","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s11081-018-9402-9","article-title":"New SOCP relaxation and branching rule for bipartite bilinear programs","volume":"20","author":"Dey","year":"2019","journal-title":"Optim. Eng."},{"key":"10.1016\/j.orl.2026.107446_bib0010","doi-asserted-by":"crossref","DOI":"10.1287\/ijoc.2024.0755.cd","article-title":"Spatial branch-and-bound for nonconvex separable piecewise linear optimization","author":"H\u00fcbner","year":"2025","journal-title":"INFORMS J. Comput."},{"issue":"4-5","key":"10.1016\/j.orl.2026.107446_bib0011","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1080\/10556780903087124","article-title":"Branching and bounds tighteningtechniques for non-convex MINLP","volume":"24","author":"Belotti","year":"2009","journal-title":"Optim. Methods Softw."},{"key":"10.1016\/j.orl.2026.107446_bib0012","doi-asserted-by":"crossref","unstructured":"R. Kannan, H. Nagarajan, D. Deka, Strong partitioning and a machine learning approximation for accelerating the global optimization of nonconvex quadratically constrained quadratic programs, INFORMS Journal on Computing, 2025, 10.1287\/ijoc.2023.0424.","DOI":"10.1287\/ijoc.2023.0424"},{"issue":"3","key":"10.1016\/j.orl.2026.107446_bib0013","doi-asserted-by":"crossref","first-page":"1123","DOI":"10.1007\/s10589-024-00633-0","article-title":"Solving continuous and discrete nonlinear programs with BARON","volume":"92","author":"Zhang","year":"2025","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.orl.2026.107446_bib0014","unstructured":"K. Kim, BranchAndBound.jl, 2020, https:\/\/github.com\/kibaekkim\/BranchAndBound.jl."},{"issue":"2","key":"10.1016\/j.orl.2026.107446_bib0015","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF00138693","article-title":"BARON: a general purpose global optimization software package","volume":"8","author":"Sahinidis","year":"1996","journal-title":"J. Global Optim."},{"issue":"1","key":"10.1016\/j.orl.2026.107446_bib0016","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","article-title":"Computability of global solutions to factorable nonconvex programs: part I-convex underestimating problems","volume":"10","author":"McCormick","year":"1976","journal-title":"Math. Program."},{"key":"10.1016\/j.orl.2026.107446_bib0017","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","article-title":"On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming","volume":"106","author":"W\u00e4chter","year":"2006","journal-title":"Math. Program."},{"issue":"1","key":"10.1016\/j.orl.2026.107446_bib0018","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s12532-017-0130-5","article-title":"Parallelizing the dual revised simplex method","volume":"10","author":"Huangfu","year":"2018","journal-title":"Math. Program. Comput."},{"issue":"1","key":"10.1016\/j.orl.2026.107446_bib0019","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1287\/ijoc.15.1.114.15159","article-title":"MINLPLib-a collection of test models for mixed-integer nonlinear programming","volume":"15","author":"Bussieck","year":"2003","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.orl.2026.107446_bib0020","doi-asserted-by":"crossref","unstructured":"T.E. Schreiber, Y. Otsuki, Y. Wang, Finite element model updating using primal-relaxed dual global optimization algorithm, Structural Health Monitoring 2023(2023).","DOI":"10.12783\/shm2023\/36808"},{"key":"10.1016\/j.orl.2026.107446_bib0021","unstructured":"S.S. Dey, D. Han, Y. Wang, Aggregation of bilinear bipartite equality constraints and its application to structural model updating problem, (2024).arXiv: 2410.14163."},{"key":"10.1016\/j.orl.2026.107446_bib0022","unstructured":"L. Gurobi Optimization, Gurobi Optimizer Reference Manual, 2024. https:\/\/www.gurobi.com."},{"key":"10.1016\/j.orl.2026.107446_bib0023","unstructured":"P. Belotti, Couenne: a user\u2019s manual, 2009."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016763772600043X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016763772600043X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T16:17:48Z","timestamp":1779553068000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016763772600043X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":23,"alternative-id":["S016763772600043X"],"URL":"https:\/\/doi.org\/10.1016\/j.orl.2026.107446","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Extreme strong branching for QCQPs","name":"articletitle","label":"Article Title"},{"value":"Operations Research Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.orl.2026.107446","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"107446"}}