{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:47:52Z","timestamp":1761896872349,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,10,29]],"date-time":"2018-10-29T00:00:00Z","timestamp":1540771200000},"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":["Comput Optim Appl"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s10589-018-0042-y","type":"journal-article","created":{"date-parts":[[2018,10,29]],"date-time":"2018-10-29T15:56:13Z","timestamp":1540828573000},"page":"309-337","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A feasible rounding approach for mixed-integer optimization problems"],"prefix":"10.1007","volume":"72","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":[[2018,10,29]]},"reference":[{"key":"42_CR1","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":"42_CR2","unstructured":"Achterberg, T., Bixby, R., Gu, Z., Rothberg, E., Weninger, D.: Presolve reductions in mixed integer programming, Technical Report pp. 16\u201344, ZIB"},{"key":"42_CR3","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.orl.2005.07.009","volume":"34","author":"T Achterberg","year":"2006","unstructured":"Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Oper. Res. Lett. 34, 361\u2013372 (2006)","journal-title":"Oper. Res. Lett."},{"key":"42_CR4","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0602044","volume":"2","author":"SP Baum","year":"1981","unstructured":"Baum, S.P., Trotter Jr., L.E.: Integer rounding for polymatroid and branching optimization problems. SIAM J. Algebraic Discrete Methods 2, 416\u2013425 (1981)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"42_CR5","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":"42_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.disopt.2006.10.001","volume":"4","author":"L Bertacco","year":"2007","unstructured":"Bertacco, L., Fischetti, M., Lodi, A.: A feasibility pump heuristic for general mixed-integer problems. Discrete Optim. 4, 63\u201376 (2007)","journal-title":"Discrete Optim."},{"key":"42_CR7","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":"42_CR8","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":"42_CR9","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s12532-014-0068-9","volume":"6","author":"NL Boland","year":"2014","unstructured":"Boland, N.L., Eberhard, A.C., Engineer, F.G., Fischetti, M., Savelsbergh, M.W.P., Tsoukalas, A.: Boosting the feasibility pump. Math. Program. Comput. 6, 255\u2013279 (2014)","journal-title":"Math. Program. Comput."},{"key":"42_CR10","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":"42_CR11","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, New York (2014)"},{"key":"42_CR12","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":"42_CR13","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":"42_CR14","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1287\/opre.17.4.600","volume":"17","author":"FS Hillier","year":"1969","unstructured":"Hillier, F.S.: Efficient heuristic procedures for integer linear programming with an interior. Oper. Res. 17, 600\u2013637 (1969)","journal-title":"Oper. Res."},{"key":"42_CR15","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/0208040","volume":"8","author":"R Kannan","year":"1979","unstructured":"Kannan, R., Bachem, A.: Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix. SIAM J. Comput. 8, 499\u2013507 (1979)","journal-title":"SIAM J. Comput."},{"key":"42_CR16","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R.E., Danna, E., Gamrath, G., Gleixner, A.M., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D.E., Wolter, K.: MIPLIB 2010. Math. Program. Comput. 3, 103\u2013163 (2011)","journal-title":"Math. Program. Comput."},{"key":"42_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-011-0032-x","volume":"4","author":"G Nannicini","year":"2012","unstructured":"Nannicini, G., Belotti, P.: Rounding-based heuristics for nonconvex MINLPs. Math. Program. Comput. 4, 1\u201331 (2012)","journal-title":"Math. Program. Comput."},{"key":"42_CR18","unstructured":"Neumann, C., Stein, O., Sudermann-Merx, N.: Granularity in nonlinear mixed-integer optimization. Optimization Online, Preprint ID 2017-12-6367 (2017)"},{"key":"42_CR19","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1998","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Hoboken (1998)"},{"key":"42_CR20","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":"42_CR21","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."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-018-0042-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0042-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0042-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,6]],"date-time":"2023-09-06T14:02:06Z","timestamp":1694008926000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-018-0042-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,29]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["42"],"URL":"https:\/\/doi.org\/10.1007\/s10589-018-0042-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2018,10,29]]},"assertion":[{"value":"8 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}