{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,21]],"date-time":"2024-03-21T06:43:00Z","timestamp":1711003380698},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,9,1]],"date-time":"2011-09-01T00:00:00Z","timestamp":1314835200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s12532-011-0032-x","type":"journal-article","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T05:32:23Z","timestamp":1314768743000},"page":"1-31","source":"Crossref","is-referenced-by-count":30,"title":["Rounding-based heuristics for nonconvex MINLPs"],"prefix":"10.1007","volume":"4","author":[{"given":"Giacomo","family":"Nannicini","sequence":"first","affiliation":[]},{"given":"Pietro","family":"Belotti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,9,1]]},"reference":[{"issue":"1","key":"32_CR1","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1137\/0123007","volume":"23","author":"E. Balas","year":"1972","unstructured":"Balas E., Jeroslow R.: Canonical cuts on the unit hypercube. SIAM J. Appl. Math. 23(1), 61\u201369 (1972)","journal-title":"SIAM J. Appl. Math."},{"key":"32_CR2","unstructured":"Belotti, P.: Couenne: a user\u2019s manual. Tech. Rep., Lehigh University (2009). http:\/\/www.coin-or.org\/Couenne"},{"issue":"4\u20135","key":"32_CR3","first-page":"597","volume":"24","author":"P. Belotti","year":"2008","unstructured":"Belotti P., Lee J., Liberti L., Margot F., W\u00e5chter A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Softw. 24(4\u20135), 597\u2013634 (2008)","journal-title":"Optim. Methods Softw."},{"key":"32_CR4","volume-title":"Systematic Methods of Chemical Process Design","author":"L. Biegler","year":"1997","unstructured":"Biegler L., Grossmann I., Westerberg A.: Systematic Methods of Chemical Process Design. Prentice Hall, Upper Saddle River (NJ) (1997)"},{"issue":"2","key":"32_CR5","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10107-008-0212-2","volume":"119","author":"P. Bonami","year":"2009","unstructured":"Bonami P., Cornu\u00e9jols G., Lodi A., Margot F.: A feasibility pump for Mixed Integer Nonlinear Programs. Math. Program. 119(2), 331\u2013352 (2009)","journal-title":"Math. Program."},{"key":"32_CR6","unstructured":"Bonami, P., Gon\u00e7alves, J.: Primal heuristics for mixed-integer nonlinear programs. Tech. Rep. RC24639, IBM (2008)"},{"key":"32_CR7","unstructured":"Bussieck, M.R., Drud, A.S., Meeraus, A.: MINLPLib\u2014a collection of test models for Mixed-Integer Nonlinear Programming. INFORMS J. Comput.15(1) (2003). http:\/\/www.gamsworld.org\/minlp\/minlplib.htm"},{"key":"32_CR8","unstructured":"D\u2019Ambrosio, C.: Application oriented Mixed Integer Nonlinear Programming. Ph.D. thesis, DEIS, Universit\u00e0 di Bologna (2009)"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"D\u2019Ambrosio, C., Frangioni, A., Liberti, L., Lodi, A.: Experiments with a Feasibility Pump approach for nonconvex MINLPs. In: Festa, P. (ed.) Proceedings of the 9th Symposium on Experimental Algorithms (SEA 2010), Lecture Notes in Computer Science, vol. 6049. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-13193-6_30"},{"issue":"5","key":"32_CR10","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/j.orl.2010.05.010","volume":"38","author":"C. D\u2019Ambrosio","year":"2010","unstructured":"D\u2019Ambrosio C., Frangioni A., Liberti L., Lodi A.: On interval-subgradient and no-good cuts. Oper. Res. Lett. 38(5), 341\u2013345 (2010)","journal-title":"Oper. Res. Lett."},{"key":"32_CR11","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","volume":"102","author":"E. Danna","year":"2005","unstructured":"Danna E., Rothberg E., Le Pape C.: Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Program. A 102, 71\u201390 (2005)","journal-title":"Math. Program. A"},{"issue":"1","key":"32_CR12","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-004-0570-3","volume":"104","author":"M. Fischetti","year":"2005","unstructured":"Fischetti M., Glover F., Lodi A.: The feasibility pump. Math. Program. A 104(1), 91\u2013104 (2005)","journal-title":"Math. Program. A"},{"key":"32_CR13","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M. Fischetti","year":"2003","unstructured":"Fischetti M., Lodi A.: Local branching. Math. Program. 98, 23\u201337 (2003)","journal-title":"Math. Program."},{"key":"32_CR14","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0959-1524(99)00019-0","volume":"10","author":"C. Floudas","year":"2001","unstructured":"Floudas C.: Global optimization in design and control of chemical process systems. J. Process Control 10, 125\u2013134 (2001)","journal-title":"J. Process Control"},{"issue":"3","key":"32_CR15","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F.W. Glover","year":"1989","unstructured":"Glover F.W.: Tabu search\u2014part I. ORSA J. Comput. 1(3), 190\u2013206 (1989)","journal-title":"ORSA J. Comput."},{"key":"32_CR16","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"Hansen P., Mladenovi\u0107 N.: Variable neighbourhood search: principles and applications. Eur. J. Oper. Res. 130, 449\u2013467 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"32_CR17","unstructured":"IBM ILOG: IBM ILOG CPLEX 12.1 User\u2019s Manual. IBM ILOG, Gentilly, France (2010)"},{"key":"32_CR18","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s12532-009-0009-1","volume":"1","author":"F. Kilin\u00e7 Karzan","year":"2009","unstructured":"Kilin\u00e7 Karzan F., Nemhauser G.L., Savelsbergh M.W.P.: Information-based branching schemes for binary linear mixed-integer programs. Math. Program. Comput. 1, 249\u2013293 (2009)","journal-title":"Math. Program. Comput."},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"Liberti, L., Mladenovi\u0107, N., Nannicini, G.: A good recipe for solving MINLPs. Math. Program. Comput. (2011). doi: 10.1007\/s12532-011-0031-y","DOI":"10.1007\/s12532-011-0031-y"},{"key":"32_CR20","unstructured":"Lindo Systems: LINDO Solver Suite: user manual. http:\/\/www.gams.com\/solvers\/lindoglobal.pdf"},{"key":"32_CR21","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01580665","volume":"10","author":"G. McCormick","year":"1976","unstructured":"McCormick G.: Computability of global solutions to factorable nonconvex programs: Part i\u2014convex underestimating problems. Math. Program. 10, 146\u2013175 (1976)","journal-title":"Math. Program."},{"key":"32_CR22","unstructured":"Nannicini, G., Belotti, P.: Rounding-based heuristics for nonconvex MINLPs. In: Bonami, P., Liberti, L., Miller, A., Sartenaer, A. (eds.) Proceedings of the European Workshop on MINLP. CIRM, Marseille, France (2010)"},{"key":"32_CR23","unstructured":"Nannicini, G., Belotti, P., Liberti, L.: A local branching heuristic for MINLPs. Tech. Rep. 0812.2188 (2008). http:\/\/arxiv.org\/abs\/0812.2188"},{"key":"32_CR24","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G. Nemhauser","year":"1988","unstructured":"Nemhauser G., Wolsey L.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"issue":"2","key":"32_CR25","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(2), 201\u2013205 (1996)","journal-title":"J. Glob. Optim."},{"key":"32_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1008241411395","volume":"12","author":"J. Shectman","year":"1998","unstructured":"Shectman J., Sahinidis N.: A finite algorithm for global minimization of separable concave programs. J. Glob. Optim. 12, 1\u201336 (1998)","journal-title":"J. Glob. Optim."},{"key":"32_CR27","unstructured":"Smith, E.: On the optimal design of continuous processes. Ph.D. thesis, Imperial College of Science, Technology and Medicine, University of London (1996)"},{"key":"32_CR28","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/S0098-1354(98)00286-5","volume":"23","author":"E. Smith","year":"1999","unstructured":"Smith E., Pantelides C.: A symbolic reformulation\/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs. Comput. Chem. Eng. 23, 457\u2013478 (1999)","journal-title":"Comput. Chem. Eng."},{"key":"32_CR29","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","volume":"99","author":"M. Tawarmalani","year":"2004","unstructured":"Tawarmalani M., Sahinidis N.: Global optimization of mixed integer nonlinear programs: a theoretical and computational study. Math. Program. 99, 563\u2013591 (2004)","journal-title":"Math. Program."},{"issue":"1","key":"32_CR30","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A. W\u00e4chter","year":"2006","unstructured":"W\u00e4chter A., Biegler L.T.: On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006)","journal-title":"Math. Program."},{"key":"32_CR31","volume-title":"Integer Programming","author":"L. Wolsey","year":"1998","unstructured":"Wolsey L.: Integer Programming. Wiley, New York (1998)"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-011-0032-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-011-0032-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-011-0032-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T16:33:21Z","timestamp":1560530001000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-011-0032-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,1]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["32"],"URL":"https:\/\/doi.org\/10.1007\/s12532-011-0032-x","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9,1]]}}}