{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T17:30:21Z","timestamp":1776965421747,"version":"3.51.4"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2014,11,4]],"date-time":"2014-11-04T00:00:00Z","timestamp":1415059200000},"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":["J Heuristics"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s10732-014-9266-x","type":"journal-article","created":{"date-parts":[[2014,11,3]],"date-time":"2014-11-03T18:48:55Z","timestamp":1415040535000},"page":"709-731","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":66,"title":["Proximity search for 0-1 mixed-integer convex programming"],"prefix":"10.1007","volume":"20","author":[{"given":"Matteo","family":"Fischetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michele","family":"Monaci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,4]]},"reference":[{"issue":"1","key":"9266_CR1","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)","journal-title":"Discret. Optim."},{"key":"9266_CR2","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/978-3-642-29210-1_12","volume":"2011","author":"T Achterberg","year":"2012","unstructured":"Achterberg, T., Berthold, T., Hendel, G.: Rounding and propagation heuristics for mixed integer programming. Op. Res. Proc. 2011, 71\u201376 (2012)","journal-title":"Op. Res. Proc."},{"issue":"1","key":"9266_CR3","doi-asserted-by":"crossref","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. Discret. Optim. 4(1), 63\u201376 (2007)","journal-title":"Discret. Optim."},{"key":"9266_CR4","unstructured":"Berthold, T.: Measuring the impact of primal heuristics. Oper. Res. Lett. 41(6), 611\u2013614 (2013)"},{"issue":"3","key":"9266_CR5","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1137\/110823596","volume":"22","author":"NL Boland","year":"2012","unstructured":"Boland, N.L., Eberhard, A.C., Engineer, F.G., Tsoukalas, A.: A new approach to the feasibility pump in mixed integer programming. SIAM J. Optim. 22(3), 831\u2013861 (2012)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9266_CR6","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. Progr. 119(2), 331\u2013352 (2009)","journal-title":"Math. Progr."},{"issue":"2","key":"9266_CR7","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1287\/opre.1100.0854","volume":"59","author":"JP Brooks","year":"2011","unstructured":"Brooks, J.P.: Support vector machines with the ramp loss and the hard margin loss. Op. Res. 59(2), 467\u2013479 (2011)","journal-title":"Op. Res."},{"issue":"2","key":"9266_CR8","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s10107-012-0608-x","volume":"136","author":"C D\u2019Ambrosio","year":"2012","unstructured":"D\u2019Ambrosio, C., Frangioni, A., Liberti, L., Lodi, A.: A storm of feasibility pumps for nonconvex MINLP. Math. Progr. 136(2), 375\u2013402 (2012)","journal-title":"Math. Progr."},{"issue":"1","key":"9266_CR9","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/s10107-004-0571-2","volume":"104","author":"A Daniilidis","year":"2005","unstructured":"Daniilidis, A., Lemarechal, C.: On a primal-proximal heuristic in discrete optimization. Math. Progr. 104(1), 105\u2013128 (2005)","journal-title":"Math. Progr."},{"issue":"1","key":"9266_CR10","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. Progr. 102(1), 71\u201390 (2005)","journal-title":"Math. Progr."},{"issue":"1","key":"9266_CR11","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. Progr. 104(1), 91\u2013104 (2005)","journal-title":"Math. Progr."},{"issue":"1\u20133","key":"9266_CR12","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. Progr. 98(1\u20133), 23\u201347 (2003)","journal-title":"Math. Progr."},{"key":"9266_CR13","first-page":"738","volume-title":"Heuristics in Mixed Integer Programming","author":"M Fischetti","year":"2011","unstructured":"Fischetti, M., Lodi, A.: Heuristics in Mixed Integer Programming, vol. 8, pp. 738\u2013747. Wiley, New York (2011)"},{"key":"9266_CR14","doi-asserted-by":"crossref","unstructured":"Fischetti, M., Sartor, G., Zanette, A.: A MIP-and-refine matheuristic for smart grid energy management. Int. Trans. Op. Res., 1\u201311 (2013). doi: 10.1111\/itor.12034","DOI":"10.1111\/itor.12034"},{"key":"9266_CR15","doi-asserted-by":"crossref","unstructured":"Fischetti, M., Monaci, M.: Proximity search heuristics for wind farm optimal layout. Technical Report DEI, University of Padova (2014, submitted).","DOI":"10.1007\/s10732-015-9283-4"},{"issue":"2","key":"9266_CR16","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0305-0483(78)90022-1","volume":"6","author":"F Glover","year":"1978","unstructured":"Glover, F.: Parametric branch and bound. OMEGA 6(2), 145\u2013152 (1978)","journal-title":"OMEGA"},{"issue":"9","key":"9266_CR17","doi-asserted-by":"crossref","first-page":"2449","DOI":"10.1016\/j.cor.2005.07.009","volume":"33","author":"F Glover","year":"2006","unstructured":"Glover, F.: Parametric tabu search for mixed integer programs. Comput. Op. Res. 33(9), 2449\u20132494 (2006)","journal-title":"Comput. Op. Res."},{"key":"9266_CR18","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms, Volume II: Advanced Theory and Bundle Methods, Volume 306 of Grundlehren der mathematischen Wissenschaften. Springer, Berlin (1993)","DOI":"10.1007\/978-3-662-06409-2"},{"key":"9266_CR19","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 mixed integer programming library version 5. Math. Progr. Comput. 3(2), 103\u2013163 (2011)"},{"key":"9266_CR20","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2009","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization. Springer, Berlin (2009)"},{"issue":"3","key":"9266_CR21","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1002\/net.20371","volume":"55","author":"S Orlowski","year":"2010","unstructured":"Orlowski, S., Wess\u00e4ly, R., Pi\u00f3ro, M., Tomaszewski, A.: SNDlib 1.0\u2014survivable network design library. Networks 55(3), 276\u2013286 (2010)","journal-title":"Networks"},{"issue":"2","key":"9266_CR22","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1002\/net.20395","volume":"57","author":"C Raack","year":"2011","unstructured":"Raack, C., Koster, A., Orlowski, S., Wess\u00e4ly, R.: On cut-based inequalities for capacitated network design polyhedra. Networks 57(2), 141\u2013156 (2011)","journal-title":"Networks"},{"issue":"4","key":"9266_CR23","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1287\/ijoc.1060.0189","volume":"19","author":"E Rothberg","year":"2007","unstructured":"Rothberg, E.: An evolutionary algorithm for polishing mixed integer programming solutions. INFORMS J. Comput. 19(4), 534\u2013541 (2007)","journal-title":"INFORMS J. Comput."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-014-9266-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-014-9266-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-014-9266-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T17:01:54Z","timestamp":1717520514000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-014-9266-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,4]]},"references-count":23,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["9266"],"URL":"https:\/\/doi.org\/10.1007\/s10732-014-9266-x","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,4]]}}}