{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:52:16Z","timestamp":1761897136398,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T00:00:00Z","timestamp":1570147200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T00:00:00Z","timestamp":1570147200000},"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":["J Optim Theory Appl"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s10957-019-01591-y","type":"journal-article","created":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T10:03:16Z","timestamp":1570183396000},"page":"433-465","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Granularity in Nonlinear Mixed-Integer Optimization"],"prefix":"10.1007","volume":"184","author":[{"given":"Christoph","family":"Neumann","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9514-6317","authenticated-orcid":false,"given":"Oliver","family":"Stein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Nathan","family":"Sudermann-Merx","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,4]]},"reference":[{"key":"1591_CR1","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s10589-018-0042-y","volume":"72","author":"C Neumann","year":"2019","unstructured":"Neumann, C., Stein, O., Sudermann-Merx, N.: A feasible rounding approach for mixed-integer optimization problems. Comput. Optim. Appl. 72, 309\u2013337 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"1591_CR2","doi-asserted-by":"publisher","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. 102, 71\u201390 (2005)","journal-title":"Math. Program."},{"key":"1591_CR3","volume-title":"Combinatorial Optimization","author":"CH Papadimitriou","year":"1998","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization. Dover Publications, Mineola (1998)"},{"key":"1591_CR4","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.disopt.2006.10.004","volume":"4","author":"T Achterberg","year":"2007","unstructured":"Achterberg, T., Berthold, T.: Improving the feasibility pump. Discrete Optim. 4, 77\u201386 (2007)","journal-title":"Discrete Optim."},{"key":"1591_CR5","doi-asserted-by":"publisher","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. 104, 91\u2013104 (2005)","journal-title":"Math. Program."},{"key":"1591_CR6","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s12532-009-0007-3","volume":"1","author":"M Fischetti","year":"2009","unstructured":"Fischetti, M., Salvagnin, D.: Feasibility pump 2.0. Math. Program. Comput. 1, 201\u2013222 (2009)","journal-title":"Math. Program. Comput."},{"key":"1591_CR7","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10107-013-0635-2","volume":"144","author":"T Berthold","year":"2014","unstructured":"Berthold, T., Gleixner, A.M.: Undercover: a primal MINLP heuristic exploring a largest sub-MIP. Math. Program. 144, 315\u2013346 (2014)","journal-title":"Math. Program."},{"key":"1591_CR8","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s12532-013-0060-9","volume":"6","author":"T Berthold","year":"2014","unstructured":"Berthold, T.: RENS\u2014the optimal rounding. Math. Program. Comput. 6, 33\u201354 (2014)","journal-title":"Math. Program. Comput."},{"key":"1591_CR9","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s10589-010-9350-6","volume":"51","author":"P Bonami","year":"2012","unstructured":"Bonami, P., Gon\u00e7alves, J.P.M.: Heuristics for convex mixed integer nonlinear programs. Comput. Optim. Appl. 51, 729\u2013747 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"1591_CR10","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)","journal-title":"Acta Numer."},{"key":"1591_CR11","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s10107-015-0872-7","volume":"156","author":"O Stein","year":"2016","unstructured":"Stein, O.: Error bounds for mixed integer linear optimization problems. Math. Program. 156, 101\u2013123 (2016)","journal-title":"Math. Program."},{"key":"1591_CR12","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1007\/s11590-016-1011-y","volume":"10","author":"O Stein","year":"2016","unstructured":"Stein, O.: Error bounds for mixed integer nonlinear optimization problems. Optim. Lett. 10, 1153\u20131168 (2016)","journal-title":"Optim. Lett."},{"key":"1591_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-11008-0","volume-title":"Integer Programming","author":"M Conforti","year":"2014","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Integer Programming. Springer, Cham (2014)"},{"key":"1591_CR14","series-title":"Mathematical Proceedings of the Cambridge Philosophical Society","volume-title":"How to Solve a Quadratic Equation in Integers.","author":"F Grunewald","year":"1981","unstructured":"Grunewald, F., Segal, D.: How to Solve a Quadratic Equation in Integers. Mathematical Proceedings of the Cambridge Philosophical Society, vol. 89. Cambridge University Press, Cambridge (1981)"},{"key":"1591_CR15","unstructured":"Siegel, C.L.: Zur Theorie der quadratischen Formen. Nachr. Akad. Wiss. G\u00f6ttingen, Math.-Phys. Klasse, 21\u201346 (1972)"},{"key":"1591_CR16","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1287\/ijoc.15.1.114.15159","volume":"15","author":"MR Bussieck","year":"2003","unstructured":"Bussieck, M.R., Drud, A.S., Meeraus, A.: MINLPLib\u2014a collection of test models for mixed-integer nonlinear programming. INFORMS J. Comput. 15, 114\u2013119 (2003)","journal-title":"INFORMS J. Comput."},{"key":"1591_CR17","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s12532-011-0026-8","volume":"3","author":"WE Hart","year":"2011","unstructured":"Hart, W.E., Watson, J.-P., Woodruff, D.L.: Pyomo: modeling and solving mathematical programs in Python. Math. Program. Comput. 3, 219\u2013260 (2011)","journal-title":"Math. Program. Comput."},{"key":"1591_CR18","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2008","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106, 25\u201358 (2008)","journal-title":"Math. Program."},{"key":"1591_CR19","unstructured":"COIN-OR. https:\/\/www.coin-or.org"},{"key":"1591_CR20","unstructured":"MINLPLib. http:\/\/www.minlplib.org\/instances.html"},{"key":"1591_CR21","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, 186\u2013204 (2008)","journal-title":"Discrete Optim."},{"key":"1591_CR22","unstructured":"Bonami, P., Lee, J.: Bonmin users\u2019 manual. Technical report, September (2009)"},{"key":"1591_CR23","volume-title":"Global Optimization Using Interval Analysis","author":"E Hansen","year":"1992","unstructured":"Hansen, E.: Global Optimization Using Interval Analysis. Marcel Dekker, New York (1992)"},{"key":"1591_CR24","volume-title":"Interval Methods for Systems of Equations","author":"A Neumaier","year":"1990","unstructured":"Neumaier, A.: Interval Methods for Systems of Equations. Cambridge University Press, Cambridge (1990)"},{"key":"1591_CR25","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"1591_CR26","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1137\/S105262349731577X","volume":"8","author":"M Fukushima","year":"1998","unstructured":"Fukushima, M., Pang, J.-S.: Some feasibility issues in mathematical programs with equilibrium constraints. SIAM J. Optim. 8, 673\u2013681 (1998)","journal-title":"SIAM J. Optim."},{"key":"1591_CR27","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1023\/A:1022645805569","volume":"93","author":"C Audet","year":"1997","unstructured":"Audet, C., Hansen, P., Jaumard, B., Savard, G.: Links between linear bilevel and mixed 0\u20131 programming problems. J. Optim. Theory Appl. 93, 273\u2013300 (1997)","journal-title":"J. Optim. Theory Appl."},{"key":"1591_CR28","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1057\/jors.1981.156","volume":"32","author":"J Fortuny-Amat","year":"1981","unstructured":"Fortuny-Amat, J., McCarl, B.: A representation and economic interpretation of a two-level programming problem. J. Oper. Res. Soc. 32, 783\u2013792 (1981)","journal-title":"J. Oper. Res. Soc."},{"key":"1591_CR29","unstructured":"Neumann, C., Stein, O., Sudermann-Merx, N.: Bounds on the objective value of feasible roundings (forthcoming)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-019-01591-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-019-01591-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-019-01591-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T08:21:21Z","timestamp":1695284481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-019-01591-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,4]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["1591"],"URL":"https:\/\/doi.org\/10.1007\/s10957-019-01591-y","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2019,10,4]]},"assertion":[{"value":"12 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 September 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 October 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}