{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T04:17:29Z","timestamp":1778645849184,"version":"3.51.4"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2013,3,3]],"date-time":"2013-03-03T00:00:00Z","timestamp":1362268800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s10107-013-0635-2","type":"journal-article","created":{"date-parts":[[2013,3,2]],"date-time":"2013-03-02T12:00:59Z","timestamp":1362225659000},"page":"315-346","source":"Crossref","is-referenced-by-count":26,"title":["Undercover: a primal MINLP heuristic exploring a largest sub-MIP"],"prefix":"10.1007","volume":"144","author":[{"given":"Timo","family":"Berthold","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ambros M.","family":"Gleixner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,3,3]]},"reference":[{"issue":"1","key":"635_CR1","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/j.disopt.2006.10.006","volume":"4","author":"T Achterberg","year":"2007","unstructured":"Achterberg, T.: Conflict analysis in mixed integer programming. Discret. Optim. 4(1), 4\u201320 (2007). doi: 10.1016\/j.disopt.2006.10.006","journal-title":"Discret. Optim."},{"key":"635_CR2","unstructured":"Achterberg, T.: Constraint Integer Programming. Ph.D. thesis, Technische Universit\u00e4t Berlin (2007). http:\/\/vs24.kobv.de\/opus4-zib\/frontdoor\/index\/index\/docId\/1018"},{"key":"635_CR3","doi-asserted-by":"crossref","unstructured":"Achterberg, T.: SCIP: solving constraint integer programs. Math. Program. Comput. 1(1), 1\u201341 (2009). doi: 10.1007\/s12532-008-0001-1","DOI":"10.1007\/s12532-008-0001-1"},{"issue":"1","key":"635_CR4","doi-asserted-by":"crossref","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. Discret. Optim. 4(1), 77\u201386 (2007). doi: 10.1016\/j.disopt.2006.10.004","journal-title":"Discret. Optim."},{"key":"635_CR5","doi-asserted-by":"crossref","unstructured":"Belotti, P., Lee, J., Liberti, L., Margot, F., W\u00e4chter, A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Softw. 24, 597\u2013634 (2009). doi: 10.1080\/10556780903087124","DOI":"10.1080\/10556780903087124"},{"key":"635_CR6","unstructured":"Berthold, T.: Primal Heuristics for Mixed Integer Programs. Diploma thesis, Technische Universit\u00e4t Berlin (2006). http:\/\/vs24.kobv.de\/opus4-zib\/frontdoor\/index\/index\/docId\/1029"},{"key":"635_CR7","unstructured":"Berthold, T.: RENS\u2013the Optimal Rounding. ZIB-Report 12\u201317, Zuse Institute Berlin (2012). http:\/\/vs24.kobv.de\/opus4-zib\/frontdoor\/index\/index\/docId\/1520"},{"key":"635_CR8","unstructured":"Berthold, T., Heinz, S., Pfetsch, M.E., Vigerske, S.: Large neighborhood search beyond MIP. In: Gaspero, L.D., Schaerf, A., St\u00fctzle, T. (eds.) Proceedings of the 9th Metaheuristics International Conference (MIC 2011), pp. 51\u201360 (2011). Available as Matheon Preprint # 856. urn:nbn:de:0296-matheon-9752"},{"key":"635_CR9","doi-asserted-by":"crossref","unstructured":"Berthold, T., Heinz, S., Vigerske, S.: Extending a CIP framework to solve MIQCPs. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming, The IMA Volumes in Mathematics and its Applications, vol. 154, pp. 427\u2013444. Springer (2011). doi: 10.1007\/978-1-4614-1927-3_15","DOI":"10.1007\/978-1-4614-1927-3_15"},{"key":"635_CR10","doi-asserted-by":"crossref","unstructured":"Bixby, R., Fenelon, M., Gu, Z., Rothberg, E., Wunderling, R.: MIP: Theory and practice\u2013closing the gap. In: Powell, M., Scholtes, S. (eds.) Systems Modelling and Optimization: Methods, Theory, and Applications, pp. 19\u201349. Kluwer, Dordrecht (2000)","DOI":"10.1007\/978-0-387-35514-6_2"},{"key":"635_CR11","doi-asserted-by":"crossref","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. Discret. Optim. 5, 186\u2013204 (2008). doi: 10.1016\/j.disopt.2006.10.011","journal-title":"Discret. Optim."},{"issue":"2","key":"635_CR12","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). doi: 10.1007\/s10107-008-0212-2","journal-title":"Math. Program."},{"key":"635_CR13","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1007\/s10589-010-9350-6","volume":"51","author":"P Bonami","year":"2012","unstructured":"Bonami, P., Gon\u00e7alves, J.: Heuristics for convex mixed integer nonlinear programs. Comput. Optim. Appl. 51, 729\u2013747 (2012). doi: 10.1007\/s10589-010-9350-6","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"635_CR14","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1287\/ijoc.15.1.114.15159","volume":"15","author":"M Bussieck","year":"2003","unstructured":"Bussieck, M., Drud, A., Meeraus, A.: MINLPLib\u2014a collection of test models for mixed-integer nonlinear programming. INFORMS J. Comput. 15(1), 114\u2013119 (2003). doi: 10.1287\/ijoc.15.1.114.15159","journal-title":"INFORMS J. Comput."},{"key":"635_CR15","doi-asserted-by":"crossref","unstructured":"Bussieck, M.R., Vigerske, S.: MINLP solver software. In: Cochran, J.J., Cox, L.A., Keskinocak, P., Kharoufeh, J.P., Smith, J.C. (eds.) Wiley Encyclopedia of Operations Research and Management Science. Wiley, London (2010). Online publication. doi: 10.1002\/9780470400531.eorms0527","DOI":"10.1002\/9780470400531.eorms0527"},{"key":"635_CR16","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.) Experimental Algorithms, Lecture Notes in Computer Science, vol. 6049, pp. 350\u2013360. Springer, Berlin (2010). doi: 10.1007\/978-3-642-13193-6_30","DOI":"10.1007\/978-3-642-13193-6_30"},{"issue":"1","key":"635_CR17","doi-asserted-by":"crossref","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.: Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Program. 102(1), 71\u201390 (2004). doi: 10.1007\/s10107-004-0518-7","journal-title":"Math. Program."},{"key":"635_CR18","doi-asserted-by":"crossref","first-page":"439","DOI":"10.4007\/annals.2005.162.439","volume":"162","author":"I Dinur","year":"2005","unstructured":"Dinur, I., Safra, S.: On the hardness of approximating vertex cover. Ann. Math. 162, 439\u2013485 (2005). doi: 10.4007\/annals.2005.162.439","journal-title":"Ann. Math."},{"issue":"1","key":"635_CR19","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. 104(1), 91\u2013104 (2005). doi: 10.1007\/s10107-004-0570-3","journal-title":"Math. Program."},{"issue":"1\u20133","key":"635_CR20","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(1\u20133), 23\u201347 (2003). doi: 10.1007\/s10107-003-0395-5","journal-title":"Math. Program."},{"key":"635_CR21","doi-asserted-by":"crossref","unstructured":"Fischetti, M., Salvagnin, D.: Feasibility Pump 2.0. Math. Program. Comput. 1(2\u20133), 201\u2013222 (2009). doi: 10.1007\/s12532-009-0007-3","DOI":"10.1007\/s12532-009-0007-3"},{"key":"635_CR22","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"635_CR23","doi-asserted-by":"crossref","unstructured":"Ghosh, S.: DINS, a MIP improvement heuristic. In: Fischetti, M., Williamson, D.P. (eds.) Integer Programming and Combinatorial Optimization, Proceedings of the 12th International IPCO Conference, LNCS, vol. 4513, pp. 310\u2013323. Springer, Berlin (2007). doi: 10.1007\/978-3-540-72792-7_24","DOI":"10.1007\/978-3-540-72792-7_24"},{"key":"635_CR24","doi-asserted-by":"crossref","unstructured":"Griewank, A., Walther, A.: Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation. Society for Industrial and Applied Mathematics (2008)","DOI":"10.1137\/1.9780898717761"},{"key":"635_CR25","doi-asserted-by":"crossref","first-page":"1608","DOI":"10.1137\/S0097539700381097","volume":"31","author":"E Halperin","year":"2002","unstructured":"Halperin, E.: Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. SIAM J. Comput. 31, 1608\u20131623 (2002). doi: 10.1137\/S0097539700381097","journal-title":"SIAM J. Comput."},{"issue":"1","key":"635_CR26","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00121301","volume":"2","author":"P Hansen","year":"1992","unstructured":"Hansen, P., Jaumard, B.: Reduction of indefinite quadratic programs to bilinear programs. J. Glob. Optim. 2(1), 41\u201360 (1992). doi: 10.1007\/BF00121301","journal-title":"J. Glob. Optim."},{"key":"635_CR27","doi-asserted-by":"crossref","unstructured":"Karakostas, G.: A better approximation ratio for the vertex cover problem. ACM Trans. Algorithms, 5, 41:1\u201341:8 (2009). doi: 10.1145\/1597036.1597045","DOI":"10.1145\/1597036.1597045"},{"issue":"3","key":"635_CR28","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/j.jcss.2007.06.019","volume":"74","author":"S Khot","year":"2008","unstructured":"Khot, S., Regev, O.: Vertex cover might be hard to approximate to within $$2-\\epsilon $$ . J. Comput. Syst. Sci. 74(3), 335\u2013349 (2008). doi: 10.1016\/j.jcss.2007.06.019","journal-title":"J. Comput. Syst. Sci."},{"key":"635_CR29","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF01580367","volume":"11","author":"H Konno","year":"1976","unstructured":"Konno, H.: A cutting plane algorithm for solving bilinear programs. Math. Program. 11, 14\u201327 (1976). doi: 10.1007\/BF01580367","journal-title":"Math. Program."},{"key":"635_CR30","doi-asserted-by":"crossref","unstructured":"Land, A.H., Doig, A.G.: An automatic method of solving discrete programming problems. Econometrica, 28(3), 497\u2013520 (1960). http:\/\/www.jstor.org\/stable\/1910129","DOI":"10.2307\/1910129"},{"key":"635_CR31","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s12532-011-0031-y","volume":"3","author":"L Liberti","year":"2011","unstructured":"Liberti, L., Mladenovi\u0107, N., Nannicini, G.: A recipe for finding good solutions to MINLPs. Math. Program. Comput. 3, 349\u2013390 (2011). doi: 10.1007\/s12532-011-0031-y","journal-title":"Math. Program. Comput."},{"issue":"4\u20135","key":"635_CR32","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1080\/10556780902753221","volume":"24","author":"Y Lin","year":"2009","unstructured":"Lin, Y., Schrage, L.: The global solver in the LINDO API. Optim. Methods Softw. 24(4\u20135), 657\u2013668 (2009). doi: 10.1080\/10556780902753221","journal-title":"Optim. Methods Softw."},{"key":"635_CR33","doi-asserted-by":"crossref","unstructured":"Misener, R., Floudas, C.A.: Global Optimization of Mixed-Integer Quadratically-Constrained Quadratic Programs (MIQCQP) Through Piecewise-Linear and Edge-Concave Relaxations. Mathematical Programming (2012). Online publication. doi: 10.1007\/s10107-012-0555-6","DOI":"10.1007\/s10107-012-0555-6"},{"key":"635_CR34","doi-asserted-by":"crossref","unstructured":"Misener, R., Floudas, C.A.: GloMIQO: Global mixed-integer quadratic optimizer. J. Glob. Optim. (2012). Online publication. doi: 10.1007\/s10898-012-9874-7","DOI":"10.1007\/s10898-012-9874-7"},{"key":"635_CR35","doi-asserted-by":"crossref","unstructured":"Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proceedings of the 38th Annual Design Automation Conference (DAC \u201901), pp. 530\u2013535 (2001). doi: 10.1145\/378239.379017","DOI":"10.1145\/378239.379017"},{"issue":"1","key":"635_CR36","doi-asserted-by":"crossref","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), 1\u201331 (2012). doi: 10.1007\/s12532-011-0032-x","journal-title":"Math. Program. Comput."},{"key":"635_CR37","unstructured":"Nannicini, G., Belotti, P., Liberti, L.: A local branching heuristic for MINLPs. ArXiv e-print 0812.2188, Cornell University (2008). http:\/\/arxiv.org\/abs\/0812.2188"},{"key":"635_CR38","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.V.: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study. Math. Program. 99, 563\u2013591 (2004). doi: 10.1007\/s10107-003-0467-6","journal-title":"Math. Program."},{"key":"635_CR39","unstructured":"Vigerske, S.: Decomposition in Multistage Stochastic Programming and a Constraint Integer Programming Approach to Mixed-Integer Nonlinear Programming. Ph.D. thesis, Humboldt-Universit\u00e4t zu Berlin (2012) (to appear)"},{"issue":"1","key":"635_CR40","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). doi: 10.1007\/s10107-004-0559-y","journal-title":"Math. Program."},{"key":"635_CR41","unstructured":"CppAD. A Package for Differentiation of C++ Algorithms. http:\/\/www.coin-or.org\/CppAD"},{"key":"635_CR42","unstructured":"GloMIQO 2.0. http:\/\/helios.princeton.edu\/GloMIQO\/"},{"key":"635_CR43","unstructured":"IBM, ILOG CPLEX Optimizer. http:\/\/www.cplex.com"},{"key":"635_CR44","unstructured":"LindoGlobal. Lindo Systems, Inc. http:\/\/www.lindo.com"},{"key":"635_CR45","unstructured":"MINOTAUR: a toolkit for MINLP. http:\/\/wiki.mcs.anl.gov\/minotaur"},{"key":"635_CR46","unstructured":"SBB. ARKI Consulting & Development A\/S and GAMS Inc. http:\/\/www.gams.com\/solvers\/solvers.htm#SBB"},{"key":"635_CR47","unstructured":"SCIP. Solving Constraint Integer Programs. http:\/\/scip.zib.de"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-013-0635-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-013-0635-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-013-0635-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:00:02Z","timestamp":1559124002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-013-0635-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,3]]},"references-count":47,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["635"],"URL":"https:\/\/doi.org\/10.1007\/s10107-013-0635-2","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,3]]}}}