{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T03:13:35Z","timestamp":1771470815402,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642385261","type":"print"},{"value":"9783642385278","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38527-8_21","type":"book-chapter","created":{"date-parts":[[2013,5,8]],"date-time":"2013-05-08T13:23:02Z","timestamp":1368019382000},"page":"224-235","source":"Crossref","is-referenced-by-count":5,"title":["Quadratic Outer Approximation for Convex Integer Programming with Box Constraints"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Buchheim","sequence":"first","affiliation":[]},{"given":"Long","family":"Trieu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"IBM ILOG CPLEX Optimizer 12.4 (2013), \n                    \n                      www.ibm.com\/software\/integration\/optimization\/cplex-optimizer"},{"issue":"2","key":"21_CR2","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 Optimization\u00a05(2), 186\u2013204 (2008)","journal-title":"Discrete Optimization"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Bonami, P., Kilin\u00e7, M., Linderoth, J.T.: Part I: Convex MINLP. In: Algorithms and Software for Solving Convex Mixed Integer Nonlinear Programs. IMA Volumes in Mathematics and its Applications: Mixed Integer Nonlinear Programming, vol.\u00a0154, pp. 1\u201339. Springer (2012)","DOI":"10.1007\/978-1-4614-1927-3_1"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Buchheim, C., Wiegele, A.: Semidefinite relaxations for non-convex quadratic mixed-integer programming. Mathematical Programming (2012) (to appear)","DOI":"10.1007\/s10107-012-0534-y"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10107-011-0475-x","volume":"135","author":"C. Buchheim","year":"2012","unstructured":"Buchheim, C., Caprara, A., Lodi, A.: An effective branch-and-bound algorithm for convex quadratic integer programming. Mathematical Programming\u00a0135, 369\u2013395 (2012)","journal-title":"Mathematical Programming"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Buchheim, C., De Santis, M., Palagi, L., Piacentini, M.: An exact algorithm for quadratic integer minimization using ellipsoidal relaxations. Technical report, Optimization Online (2012)","DOI":"10.1137\/120878495"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1093\/comjnl\/8.3.250","volume":"8","author":"R.J. Dakin","year":"1965","unstructured":"Dakin, R.J.: A tree-search algorithm for mixed integer programming problems. The Computer Journal\u00a08, 250\u2013255 (1965)","journal-title":"The Computer Journal"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"M.A. Duran","year":"1986","unstructured":"Duran, M.A., Grossmann, I.E.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Mathematical Programming\u00a036, 307\u2013339 (1986)","journal-title":"Mathematical Programming"},{"key":"21_CR9","doi-asserted-by":"publisher","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. Mathematical Programming\u00a066, 327\u2013349 (1994)","journal-title":"Mathematical Programming"},{"key":"21_CR10","first-page":"237","volume":"10","author":"A. Geoffrion","year":"1972","unstructured":"Geoffrion, A.: Generalized Benders Decomposition. Journal of Optimization\u00a010, 237\u2013260 (1972)","journal-title":"Journal of Optimization"},{"issue":"12","key":"21_CR11","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1287\/mnsc.31.12.1533","volume":"31","author":"O.K. Gupta","year":"1985","unstructured":"Gupta, O.K., Ravindran, A.: Branch and bound experiments in convex nonlinear integer programming. Management Science\u00a031(12), 1533\u20131546 (1985)","journal-title":"Management Science"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1016\/0098-1354(92)80028-8","volume":"16","author":"I. Quesada","year":"1992","unstructured":"Quesada, I., Grossmann, I.E.: An LP\/NLP based branch-and-bound algorithm for convex MINLP. Computers and Chemical Engineering\u00a016, 937\u2013947 (1992)","journal-title":"Computers and Chemical Engineering"},{"key":"21_CR13","unstructured":"Bonmin 1.5.1: Basic Open source Nonlinear Mixed INteger programming (2013), \n                    \n                      www.coin-or.org\/Bonmin"},{"key":"21_CR14","unstructured":"Van Emde Boas, P.: Another NP-complete problem and the complexity of computing short vectors in a lattice. Technical Report 81-04, University of Amsterdam, Department of Mathematics (1981)"},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0098-1354(95)87027-X","volume":"19","author":"T. Westerlund","year":"1995","unstructured":"Westerlund, T., Pettersson, F.: A cutting plane method for solving convex MINLP problems. Computers and Chemical Engineering\u00a019, 131\u2013136 (1995)","journal-title":"Computers and Chemical Engineering"}],"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_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T23:30:39Z","timestamp":1557703839000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38527-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385261","9783642385278"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38527-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}