{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T09:10:41Z","timestamp":1649063441045},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2015,12,26]],"date-time":"2015-12-26T00:00:00Z","timestamp":1451088000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s11590-015-0988-y","type":"journal-article","created":{"date-parts":[[2015,12,26]],"date-time":"2015-12-26T13:50:12Z","timestamp":1451137812000},"page":"967-981","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Linear transformation based solution methods for non-convex mixed integer quadratic programs"],"prefix":"10.1007","volume":"11","author":[{"given":"Eric","family":"Newby","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. M.","family":"Ali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,26]]},"reference":[{"key":"988_CR1","unstructured":"Newby, E.: General solution methods for mixed integer quadratic programming and derivative free mixed integer non-linear programming problems. Ph.D. dissertation, University of the Witwatersrand (2013)"},{"key":"988_CR2","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s10589-014-9660-1","volume":"60","author":"E Newby","year":"2015","unstructured":"Newby, E., Ali, M.M.: A trust-region-based derivative free algorithm for mixed integer programming. Comput. Optim. Appl. 60, 199\u2013229 (2015)","journal-title":"Comput. Optim. Appl."},{"key":"988_CR3","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s10107-010-0381-7","volume":"131","author":"A Billionnet","year":"2012","unstructured":"Billionnet, A., Elloumi, S., Lambert, A.: Extending the QCR method to general mixed-integer programs. Math. Program. 131, 381\u2013401 (2012)","journal-title":"Math. Program."},{"key":"988_CR4","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s10107-008-0223-z","volume":"120","author":"S Burer","year":"2009","unstructured":"Burer, S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Program. 120, 479\u2013495 (2009)","journal-title":"Math. Program."},{"key":"988_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-012-9874-7","author":"R Misener","year":"2012","unstructured":"Misener, R., Floudas, C.: GloMIQO: Global mixed-integer quadratic optimizer. J. Glob. Optim. (2012). doi:\n                        10.1007\/s10898-012-9874-7","journal-title":"J. Glob. Optim."},{"key":"988_CR6","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/978-1-4614-1927-3_13","volume-title":"Mixed Integer Nonlinear Programming","author":"S Burer","year":"2012","unstructured":"Burer, S., Saxena, A.: The MILP road to MIQCP. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming, pp. 373\u2013405. Springer, New York (2012)"},{"key":"988_CR7","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1006\/eujc.1996.0020","volume":"17","author":"M Laurent","year":"1996","unstructured":"Laurent, M., Poljak, S.: Gap inequalities for the cut polytope. Eur. J. Combin. 17, 233\u2013254 (1996)","journal-title":"Eur. J. Combin."},{"key":"988_CR8","first-page":"297","volume":"39","author":"L Galli","year":"2011","unstructured":"Galli, L., Kaparis, K., Letchford, A.N.: Gap inequalities for non-convex mixed-integer quadratic programs. Oper. Res. Lett. 39, 297\u2013300 (2011)","journal-title":"Oper. Res. Lett."},{"key":"988_CR9","unstructured":"Buchheim, C., Wiegele, A.: Using semidefinite programming for solving non-convex mixed-integer quadratic problems. In: Proceedings of the European Workshop on Mixed Integer Nonlinear Programming (2010)"},{"key":"988_CR10","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"N Sahinidis","year":"1996","unstructured":"Sahinidis, N.: BARON: a general purpose global optimization software package. J. Glob. Optim. 8, 201\u2013205 (1996)","journal-title":"J. Glob. Optim."},{"key":"988_CR11","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1080\/10556780903087124","volume":"24","author":"P Belotti","year":"2009","unstructured":"Belotti, P., Lee, J., Liberti, L., Margot, F., Wachter, A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Softw. 24, 597\u2013634 (2009)","journal-title":"Optim. Methods Softw."},{"key":"988_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: solving constraint integer programs. Math. Program. Comput. 1, 1\u201341 (2009)","journal-title":"Math. Program. Comput."},{"key":"988_CR13","first-page":"145","volume-title":"Frontiers in Global Optimization","author":"CY Gau","year":"2003","unstructured":"Gau, C.Y., Schrage, L.E.: Implementation and testing of a branch-and-bound based method for deterministic global optimization: operations research applications. In: Floudas, C.A., Pardalos, P.M. (eds.) Frontiers in Global Optimization, pp. 145\u2013164. Kluwer Academic Publishers, Berlin (2003)"},{"key":"988_CR14","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1080\/10556780902753221","volume":"24","author":"Y Lin","year":"2009","unstructured":"Lin, Y., Schrage, L.E.: The global solver in the LINDO API. Optim. Methods Software. 24, 657\u2013668 (2009)","journal-title":"Optim. Methods Software."},{"key":"988_CR15","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s10107-012-0555-6","volume":"136","author":"R Misener","year":"2012","unstructured":"Misener, R., Floudas, C.: GloMIQO: global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations. Math. Program. B 136, 155\u2013182 (2012)","journal-title":"Math. Program. B"},{"key":"988_CR16","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/S0098-1354(98)00305-6","volume":"23","author":"R P\u00f6rn","year":"1999","unstructured":"P\u00f6rn, R., Harjunkoski, I., Westerlund, T.: Convexification of different classes of non-convex MINLP problems. Comput. Chem. Eng. 23, 439\u2013448 (1999)","journal-title":"Comput. Chem. Eng."},{"key":"988_CR17","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/s10957-013-0340-6","volume":"160","author":"E Newby","year":"2013","unstructured":"Newby, E., Ali, M.M.: A note on convex reformulation schemes for mixed integer quadratic programs. J. Optim. Theory Appl. 160, 457\u2013469 (2013)","journal-title":"J. Optim. Theory Appl."},{"key":"988_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-015-0806-9","author":"E Newby","year":"2015","unstructured":"Newby, E., Ali, M.M.: Transformation-based preprocessing for mixed-integer quadratic programs. J. Optim. Theory Appl. (2015). doi:\n                        10.1007\/s10957-015-0806-9","journal-title":"J. Optim. Theory Appl."},{"key":"988_CR19","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix Analysis","author":"RA Horn","year":"1985","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (1985)"},{"key":"988_CR20","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: Part I convex underestimating problems. Math. Program. 10, 147\u2013175 (1976)","journal-title":"Math. Program."},{"key":"988_CR21","volume-title":"Elementary Linear Algebra","author":"H Anton","year":"2005","unstructured":"Anton, H., Rorres, C.: Elementary Linear Algebra. Wiley, New Jersey (2005)"},{"key":"988_CR22","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/99.714603","volume":"5","author":"J Czyzyk","year":"1998","unstructured":"Czyzyk, J., Mesnier, M.P., More, J.J.: The NEOS server. IEEE Comput. Sci. Eng. 5, 68\u201375 (1998)","journal-title":"IEEE Comput. Sci. Eng."},{"key":"988_CR23","first-page":"167","volume-title":"Approximation Theory and Optimization","author":"W Gropp","year":"1997","unstructured":"Gropp, W., Mor\u00e9, J.J.: Optimization environments and the NEOS server. In: Buhmann, M.D., Iserles, A. (eds.) Approximation Theory and Optimization, pp. 167\u2013182. Cambridge University Press, Cambridge (1997)"},{"key":"988_CR24","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"988_CR25","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1023\/A:1008312714792","volume":"14","author":"JM Zamora","year":"1999","unstructured":"Zamora, J.M., Grossman, I.E.: A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms. J. Glob. Optim. 14, 217\u2013249 (1999)","journal-title":"J. Glob. Optim."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0988-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0988-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0988-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0988-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:44Z","timestamp":1559409104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0988-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,26]]},"references-count":25,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["988"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0988-y","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,26]]}}}