{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T01:24:51Z","timestamp":1771982691924,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319070001","type":"print"},{"value":"9783319070018","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07001-8_4","type":"book-chapter","created":{"date-parts":[[2014,7,9]],"date-time":"2014-07-09T15:13:03Z","timestamp":1404918783000},"page":"23-28","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Primal MINLP Heuristics in a Nutshell"],"prefix":"10.1007","author":[{"given":"Timo","family":"Berthold","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,7,10]]},"reference":[{"issue":"1","key":"4_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. (2007). Improving the feasibility pump. Discrete Optimization, Special Issue, 4(1), 77\u201386.","journal-title":"Discrete Optimization, Special Issue"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T. (2009). SCIP: Solving constraint integer programs. Mathematical Programming Computation, 1(1), 1\u201341.","journal-title":"Mathematical Programming Computation"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-29210-1_12","volume-title":"Operations research proceedings 2011","author":"T Achterberg","year":"2012","unstructured":"Achterberg, T., Berthold, T., & Hendel, G. (2012). Rounding and propagation heuristics for mixed integer programming. In D. Klatte, H.-J. Luthi, & K. Schmedders (Eds.), Operations research proceedings 2011 (pp. 71\u201376). Berlin Heidelberg: Springer."},{"key":"4_CR4","unstructured":"Berthold, T. (2006). Primal heuristics for mixed integer programs. Diploma thesis, Technische Universit\u00e4t Berlin."},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Berthold, T. (2008). Heuristics of the branch-cut-and-price-framework SCIP. In J. Kalcsics & S. Nickel (Eds.), Operations research proceedings 2007 (pp. 31\u201336). New York: Springer.","DOI":"10.1007\/978-3-540-77903-2_5"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Berthold, T. (2013). Measuring the impact of the primal heuristics. Operations Research Letters, 41(6), 611\u2013614.","DOI":"10.1016\/j.orl.2013.08.007"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Berthold, T. (2014). RENS: the optimal rounding. Mathematical Programming Computation, 6(1), 33\u201354.","DOI":"10.1007\/s12532-013-0060-9"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Berthold, T., & Gleixner, A. M. (2014). Undercover: A primal MINLP heuristic exploring a largest sub-MIP. Mathematical Programming, 144(1\u20132), 315\u2013346.","DOI":"10.1007\/s10107-013-0635-2"},{"key":"4_CR9","unstructured":"Berthold, T., Heinz, S., Pfetsch, M. E., & Vigerske, S. (2011). Large neighborhood search beyond MIP. In L. D. Gaspero, A. Schaerf, & T. Stutzle (Eds.), Proceedings of the 9th Metaheuristics International Conference (MIC 2011) (pp. 51\u201360)."},{"key":"4_CR10","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., Conn, A., Cornu\u00e9jols, G., Grossmann, I., Laird, C., et al. (2008). An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optimization, 5, 186\u2013204.","journal-title":"Discrete Optimization"},{"issue":"2","key":"4_CR11","doi-asserted-by":"publisher","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. (2009). A feasibility pump for mixed integer nonlinear programs. Mathematical Programming, 119(2), 331\u2013352.","journal-title":"Mathematical Programming"},{"key":"4_CR12","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. (2012). Heuristics for convex mixed integer nonlinear programs. Computational Optimization and Applications, 51, 729\u2013747.","journal-title":"Computational Optimization and Applications"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Bussieck, M., Drud, A., & Meeraus, A. (2003). MINLPLib a collection of test models for mixed-integer nonlinear programming. INFORMS Journal on Computing, 15(1), 114\u2013119.","DOI":"10.1287\/ijoc.15.1.114.15159"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"D\u2019Ambrosio, C., Frangioni, A., Liberti, L., & Lodi, A. (2012). A storm of feasibility pumps for nonconvex MINLP. Mathematical Programming, 136, 375\u2013402.","DOI":"10.1007\/s10107-012-0608-x"},{"issue":"1","key":"4_CR15","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","volume":"102","author":"E Danna","year":"2004","unstructured":"Danna, E., Rothberg, E., & Pape, C. L. (2004). Exploring relaxation induced neighborhoods to improve MIP solutions. Mathematical Programming, 102(1), 71\u201390.","journal-title":"Mathematical Programming"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Duran, M. A., & Grossmann, I. E. (1986). An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Mathematical Programming, 36(3), 307\u2013339.","DOI":"10.1007\/BF02592064"},{"key":"4_CR17","unstructured":"Extending a CIP framework to solve MIQCPs. In J. Lee, & S. Leyffer (Eds.), Mixed integer nonlinear programming. Volume 154 of The IMA volumes in mathematics and its applications (pp. 427\u2013444). Springer."},{"issue":"1\u20133","key":"4_CR18","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M Fischetti","year":"2003","unstructured":"Fischetti, M., & Lodi, A. (2003). Local branching. Mathematical Programming, 98(1\u20133), 23\u201347.","journal-title":"Mathematical Programming"},{"issue":"1","key":"4_CR19","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. (2005). The feasibility pump. Mathematical Programming, 104(1), 91\u2013104.","journal-title":"Mathematical Programming"},{"key":"4_CR20","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. (2009). Feasibility pump 2.0. Mathematical Programming Computation, 1, 201\u2013222.","journal-title":"Mathematical Programming Computation"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Ghosh, S. (2007). DINS, a MIP improvement heuristic. In M. Fischetti & D. P. Williamson (Eds.), Proceedings of 12th International IPCO Conference on Integer Programming and Combinatorial Optimization (Vol. 4513 of LNCS, pp. 310\u2013323). Springer.","DOI":"10.1007\/978-3-540-72792-7_24"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s12532-011-0031-y","volume":"3","author":"L Liberti","year":"2011","unstructured":"Liberti, L., Mladenovic, N., & Nannicini, G. (2011). A recipe for finding good solutions to MINLPs. Mathematical Programming Computation, 3, 349\u2013390.","journal-title":"Mathematical Programming Computation"},{"key":"4_CR23","unstructured":"Mahajan, A., Leyffer, S., & Kirches, C. (2012). Solving mixed-integer nonlinear programs by QP-diving. Preprint ANL\/MCS-2071-0312, Argonne National Laboratory, Mathematics and Computer Science Division."},{"key":"4_CR24","unstructured":"Nannicini, G., Belotti, P., & Liberti, L. (2008). A local branching heuristic for MINLPs. ArXiv e-prints."},{"issue":"1","key":"4_CR25","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. (2012). Rounding-based heuristics for nonconvex MINLPs. Mathematical Programming Computation, 4(1), 1\u201331.","journal-title":"Mathematical Programming Computation"},{"issue":"4","key":"4_CR26","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1287\/ijoc.1060.0189","volume":"19","author":"E Rothberg","year":"2007","unstructured":"Rothberg, E. (2007). An evolutionary algorithm for polishing mixed integer programming solutions. INFORMS Journal on Computing, 19(4), 534\u2013541.","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"4_CR27","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., & Biegler, L. (2006). On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Mathematical Programming, 106(1), 25\u201357.","journal-title":"Mathematical Programming"},{"key":"4_CR28","unstructured":"Wunderling, R. (1996). Paralleler und objektorientierter Simplex-Algorithmus. PhD thesis, Technische Universit\u00e4t Berlin."}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2013"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07001-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T02:05:22Z","timestamp":1675994722000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-07001-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319070001","9783319070018"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07001-8_4","relation":{},"ISSN":["0721-5924"],"issn-type":[{"value":"0721-5924","type":"print"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"10 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}