{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:34:57Z","timestamp":1787333697684,"version":"build-2736575974"},"reference-count":24,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[1998,5]]},"abstract":"<jats:p>The solution of convex mixed-integer quadratic programming (MIQP) problems with a general branch-and-bound framework is considered. It is shown how lower bounds can be computed efficiently during the branch-and-bound process. Improved lower bounds such as the ones derived in this paper can reduce the number of quadratic programming (QP) problems that have to be solved. The branch-and-bound approach is also shown to be superior to other approaches in solving MIQP problems. Numerical experience is presented which supports these conclusions.<\/jats:p>","DOI":"10.1137\/s1052623494268455","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T11:12:06Z","timestamp":1055329926000},"page":"604-616","source":"Crossref","is-referenced-by-count":151,"title":["Numerical Experience with Lower Bounds for MIQP Branch-And-Bound"],"prefix":"10.1137","volume":"8","author":[{"given":"Roger","family":"Fletcher","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sven","family":"Leyffer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,31]]},"reference":[{"key":"R1","unstructured":"E. M. L. Beale,\n                      Integer Programming\n                      , in The State of the Art in Numerical Analysis, D. A. H. Jacobs, ed., London, 1978, Academic Press."},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584074"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120687"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/8.3.250"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592064"},{"key":"R6","unstructured":"R. Fletcher,\n                      Practical Methods of Optimization,2ndedition\n                      , John Wiley, Chichester, 1987."},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02023102"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581153"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(90)90045-7"},{"key":"R10","unstructured":"R. S. Garfinkel and G. L. Nemhauser,\n                      Integer Programming\n                      , John Wiley, New York, 1972."},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1007\/BF00934810"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1007\/BF02591962"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.31.12.1533"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"W. Hock and K. Schittkowski,\n                      Test Examples for Nonlinear Programming Codes\n                      , Springer\u2013Verlag, Berlin, 1981.","DOI":"10.1007\/978-3-642-48320-2"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01941144"},{"key":"R16","unstructured":"J. W. Kwiatowski,\n                      Algorithms for index tracking\n                      , Working Paper 90.1, University of Edinburgh, Centre for Financial Markets Research, 1990."},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.2307\/1910129"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585661"},{"key":"R19","unstructured":"S. Leyffer,\n                      Deterministic Methods for Mixed Integer Nonlinear Programming\n                      , Ph.D. thesis, University of Dundee, Dundee, Scotland, UK, December 1993."},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1137\/1033004"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1016\/0098-1354(92)80028-8"},{"key":"R22","doi-asserted-by":"crossref","unstructured":"H. A. Taha,\n                      Integer Programming \u2013 Theory, Applications and Computations\n                      , Academic Press, London, 1975.","DOI":"10.1016\/B978-0-12-682150-5.50007-6"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1007\/BF01074820"},{"key":"R24","first-page":"37","volume":"5","author":"Williams A. C.","year":"1981","journal-title":"Math. Programming Soc., COAL Newsletter"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S1052623494268455","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:18:26Z","timestamp":1787332706000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S1052623494268455"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["10.1137\/S1052623494268455"],"URL":"https:\/\/doi.org\/10.1137\/s1052623494268455","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}