{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:21:26Z","timestamp":1743063686221,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030484385"},{"type":"electronic","value":"9783030484392"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-48439-2_15","type":"book-chapter","created":{"date-parts":[[2020,9,24]],"date-time":"2020-09-24T15:04:52Z","timestamp":1600959892000},"page":"123-129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Convex Quadratic Mixed-Integer Problems with Quadratic Constraints"],"prefix":"10.1007","author":[{"given":"Simone","family":"G\u00f6ttlich","sequence":"first","affiliation":[]},{"given":"Kathinka","family":"Hameister","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Herty","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,25]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0962492913000032","volume":"22","author":"P Belotti","year":"2013","unstructured":"Belotti, P., Kirches, C., Leyffer, S., Linderoth, J., Luedtke, J., Mahajan, A.: Mixed-integer nonlinear optimization. Acta Numer. 22, 1\u2013131 (2013). \nhttps:\/\/doi.org\/10.1017\/S0962492913000032","journal-title":"Acta Numer."},{"issue":"6","key":"15_CR2","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1016\/j.orl.2013.08.007","volume":"41","author":"T Berthold","year":"2013","unstructured":"Berthold, T.: Measuring the impact of primal heuristics. Oper. Res. Lett. 41(6), 611\u2013614 (2013). \nhttps:\/\/doi.org\/10.1016\/S0167637713001181","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"15_CR3","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.disopt.2006.10.011","volume":"5","author":"P Bonami","year":"2008","unstructured":"Bonami, P., Biegler, L.T., Conn, A.R., Cornu\u00e9jols, G., Grossmann, I.E., Laird, C.D., Lee, J., Lodi, A., Margot, F., Sawaya, N., W\u00e4chter, A.: An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim. 5(2), 186\u2013204 (2008). \nhttps:\/\/doi.org\/10.1016\/j.disopt.2006.10.011","journal-title":"Discrete Optim."},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Bonami, P., Kilin\u00e7, M., Linderoth, J.: Algorithms and Software for Convex Mixed Integer Nonlinear Programs, pp. 1\u201339. Springer, New York (2012). \nhttps:\/\/doi.org\/10.1007\/978-1-4614-1927-3_1","DOI":"10.1007\/978-1-4614-1927-3_1"},{"issue":"4","key":"15_CR5","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0305-0548(94)90024-8","volume":"21","author":"B Borchers","year":"1994","unstructured":"Borchers, B., Mitchell, J.E.: An improved branch and bound algorithm for mixed integer nonlinear programs. Comput. Oper. Res. 21(4), 359\u2013367 (1994). \nhttps:\/\/doi.org\/10.1016\/0305-0548(94)90024-8","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"15_CR6","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1093\/comjnl\/8.3.250","volume":"8","author":"RJ Dakin","year":"1965","unstructured":"Dakin, R.J.: A tree-search algorithm for mixed integer programming problems. Comput. J. 8(3), 250\u2013255 (1965). \nhttps:\/\/doi.org\/10.1093\/comjnl\/8.3.250","journal-title":"Comput. J."},{"issue":"1\u20133","key":"15_CR7","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF01581153","volume":"66","author":"R Fletcher","year":"1994","unstructured":"Fletcher, R., Leyffer, S.: Solving mixed integer nonlinear programs by outer approximation. Math. Program. 66(1\u20133), 327\u2013349 (1994). \nhttps:\/\/doi.org\/10.1007\/BF01581153","journal-title":"Math. Program."},{"issue":"2","key":"15_CR8","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1137\/S1052623494268455","volume":"8","author":"R Fletcher","year":"1998","unstructured":"Fletcher, R., Leyffer, S.: Numerical experience with lower bounds for MIQP branch-and-bound. SIAM J. Control Optim. 8(2), 604\u2013616 (1998). \nhttps:\/\/doi.org\/10.1137\/S1052623494268455","journal-title":"SIAM J. Control Optim."},{"key":"15_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56004-0","volume-title":"Theorie und Numerik restringiererter Optimierungsaufgaben","author":"C Geiger","year":"2002","unstructured":"Geiger, C., Kanzow, C.: Theorie und Numerik restringiererter Optimierungsaufgaben. Springer, Berlin (2002)"},{"issue":"3","key":"15_CR10","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"AH Land","year":"1960","unstructured":"Land, A.H., Doig, A.G.: An automatic method of solving discrete programming problems. Econometrica 28(3), 497 (1960). \nhttps:\/\/doi.org\/10.2307\/1910129","journal-title":"Econometrica"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10898-012-9874-7","volume":"57","author":"R Misener","year":"2013","unstructured":"Misener, R., Floudas, C.A.: GloMIQO: Global mixed-integer quadratic optimizer. J. Global Optim. 57, 3\u201330 (2013)","journal-title":"J. Global Optim."},{"issue":"2","key":"15_CR12","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1023\/A:1026437621223","volume":"107","author":"N van Thoai","year":"2000","unstructured":"van Thoai, N.: Duality bound method for the general quadratic programming problem with quadratic constraints. J. Optim. Theory Appl. 107(2), 331\u2013354 (2000). \nhttps:\/\/doi.org\/10.1023\/A:1026437621223","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"15_CR13","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1287\/ijoc.1070.0256","volume":"20","author":"JP Vielma","year":"2008","unstructured":"Vielma, J.P., Ahmed, S., Nemhauser, G.L.: A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs. INFORMS J. Comput. 20(3), 438\u2013450 (2008)","journal-title":"INFORMS J. Comput."}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2019"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-48439-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,24]],"date-time":"2020-09-24T15:08:33Z","timestamp":1600960113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-48439-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030484385","9783030484392"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48439-2_15","relation":{},"ISSN":["0721-5924","2197-9294"],"issn-type":[{"type":"print","value":"0721-5924"},{"type":"electronic","value":"2197-9294"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"25 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}