{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T00:47:41Z","timestamp":1770511661848,"version":"3.49.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,4,12]],"date-time":"2014-04-12T00:00:00Z","timestamp":1397260800000},"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":["Math. Prog. Comp."],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1007\/s12532-014-0068-9","type":"journal-article","created":{"date-parts":[[2014,4,11]],"date-time":"2014-04-11T16:36:30Z","timestamp":1397234190000},"page":"255-279","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Boosting the feasibility pump"],"prefix":"10.1007","volume":"6","author":[{"given":"Natashia L.","family":"Boland","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew C.","family":"Eberhard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Faramroze G.","family":"Engineer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matteo","family":"Fischetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin W. P.","family":"Savelsbergh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelos","family":"Tsoukalas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,4,12]]},"reference":[{"key":"68_CR1","unstructured":"Achterberg, T.: Constraint integer programming. Ph.D. thesis, TU Berlin (2007)"},{"issue":"1","key":"68_CR2","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. Discrete Optim. 4(1), 77\u201386 (2007)","journal-title":"Discrete Optim."},{"issue":"5","key":"68_CR3","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/j.orl.2011.07.005","volume":"39","author":"D Baena","year":"2011","unstructured":"Baena, D., Castro, J.: Using the analytic center in the feasibility pump. Oper. Res. Lett. 39(5), 310\u2013317 (2011)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"68_CR4","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/mnsc.26.1.86","volume":"26","author":"E Balas","year":"1980","unstructured":"Balas, E., Martin, C.H.: Pivot and complement\u2014a heuristic for 0\u20131 programming. Manage. Sci. 26(1), 86\u201396 (1980)","journal-title":"Manage. Sci."},{"issue":"1","key":"68_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.disopt.2004.03.001","volume":"1","author":"E Balas","year":"2004","unstructured":"Balas, E., Schmieta, S., Wallace, C.: Pivot and shift\u2014a mixed integer programming heuristic. Discrete Optim. 1(1), 3\u201312 (2004)","journal-title":"Discrete Optim."},{"issue":"1","key":"68_CR6","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. Discrete Optim. 4(1), 63\u201376 (2007)","journal-title":"Discrete Optim."},{"issue":"1","key":"68_CR7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1287\/opre.50.1.3.17780","volume":"50","author":"RE Bixby","year":"2002","unstructured":"Bixby, R.E.: Solving real-world linear programs: a decade and more of progress. Oper. Res. 50(1), 3\u201315 (2002)","journal-title":"Oper. Res."},{"key":"68_CR8","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10479-006-0091-y","volume":"149","author":"RE Bixby","year":"2007","unstructured":"Bixby, R.E., Rothberg, E.: Progress in computational mixed integer programming\u2014a look back from the other side of the tipping point. Ann. Oper. Res. 149, 37\u201341 (2007)","journal-title":"Ann. Oper. Res."},{"key":"68_CR9","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. Program. 102, 71\u201390 (2005)","journal-title":"Math. Program."},{"key":"68_CR10","unstructured":"De Santis, M., Lucidi, S., Rinaldi, F.: New concave penalty functions for improving the feasibility pump. Optimization Online (2010). http:\/\/www.optimization-online.org\/DB_HTML\/2010\/07\/2667.html . Last accessed 24 May 2011"},{"key":"68_CR11","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10732-007-9021-7","volume":"13","author":"J Eckstein","year":"2007","unstructured":"Eckstein, J., Nediak, M.: Pivot, cut, and dive: a heuristic for 0\u20131 mixed integer programming. J. Heurist. 13, 471\u2013503 (2007)","journal-title":"J. Heurist."},{"issue":"6","key":"68_CR12","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1287\/opre.27.6.1069","volume":"27","author":"BH Faaland","year":"1979","unstructured":"Faaland, B.H., Hillier, F.S.: Interior path methods for heuristic integer programming procedures. Oper. Res. 27(6), 1069\u20131087 (1979)","journal-title":"Oper. Res."},{"key":"68_CR13","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, 91\u2013104 (2005)","journal-title":"Math. Program."},{"key":"68_CR14","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, 23\u201347 (2003)","journal-title":"Math. Program."},{"key":"68_CR15","doi-asserted-by":"crossref","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":"68_CR16","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF00132504","volume":"2","author":"F Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: General purpose heuristics for integer programming. Part I. J. Heurist. 2, 343\u2013358 (1997a)","journal-title":"J. Heurist."},{"key":"68_CR17","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1023\/A:1009631530787","volume":"3","author":"F Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: General purpose heuristics for integer programming. Part II. J. Heuristics 3, 161\u2013179 (1997b)","journal-title":"J. Heuristics"},{"issue":"2","key":"68_CR18","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0377-2217(02)00276-X","volume":"143","author":"M Halick\u00e1","year":"2002","unstructured":"Halick\u00e1, M.: Analyticity of the central path at the boundary point in semidefinite programming. Eur. J. Oper. Res. 143(2), 311\u2013324 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"68_CR19","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1016\/j.endm.2010.05.096","volume":"36","author":"S Hanafi","year":"2010","unstructured":"Hanafi, S., Lazic, J., Mladenovic, N.: Variable neighbourhood pump heuristic for 0\u20131 mixed integer programming feasibility. Electron. Notes Discrete Math. 36, 759\u2013766 (2010)","journal-title":"Electron. Notes Discrete Math."},{"issue":"4","key":"68_CR20","doi-asserted-by":"crossref","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(4), 600\u2013637 (1969)","journal-title":"Oper. Res."},{"key":"68_CR21","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/BF01681357","volume":"9","author":"RG Jeroslow","year":"1975","unstructured":"Jeroslow, R.G., Smith, T.H.C.: Experimental results on Hillier\u2019s linear search. Math. Program. 9, 371\u2013376 (1975)","journal-title":"Math. Program."},{"issue":"2\u20133","key":"68_CR22","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1016\/S0377-2217(97)00295-6","volume":"106","author":"A L\u00f6kketangen","year":"1998","unstructured":"L\u00f6kketangen, A., Glover, F.: Solving zero-one mixed integer programming problems using tabu search. Eur. J. Oper. Res. 106(2\u20133), 624\u2013658 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"9","key":"68_CR23","doi-asserted-by":"crossref","first-page":"1335","DOI":"10.1016\/j.cor.2010.12.008","volume":"38","author":"J Naoum-Sawaya","year":"2011","unstructured":"Naoum-Sawaya, J., Elhedhli, S.: An interior point cutting plane heuristic for mixed integer programming. Comput. Oper. Res. 38(9), 1335\u20131341 (2011)","journal-title":"Comput. Oper. Res."},{"key":"68_CR24","volume-title":"Handbook of Constraint Programming (Foundations of Artificial Intelligence)","author":"F Rossi","year":"2006","unstructured":"Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming (Foundations of Artificial Intelligence). Elsevier Science Inc., New York (2006)"},{"issue":"4","key":"68_CR25","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","volume":"6","author":"MWP Savelsbergh","year":"1994","unstructured":"Savelsbergh, M.W.P.: Preprocessing and probing techniques for mixed integer programming problems. Inf. J. Comput. 6(4), 445\u2013454 (1994)","journal-title":"Inf. J. Comput."},{"key":"68_CR26","unstructured":"Schulte, C.: Programming constraint services. Ph.D. thesis, Universit\u00e4t des Saarlandes, Naturwissenschaftlich-Technischen Fakult\u00e4t I, Saarbr\u00fccken (2000)"},{"key":"68_CR27","doi-asserted-by":"crossref","unstructured":"Schulte, C., Stuckey, P.J.: Speeding up constraint propagation. In: Wallace, M. (ed.) Principles and Practice of Constraint Programming\u2014CP 2004, 10th International Conference. Lecture Notes in Computer Science, pp. 619\u2013633. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-30201-8_45"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-014-0068-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-014-0068-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-014-0068-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T08:27:50Z","timestamp":1565339270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-014-0068-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,12]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["68"],"URL":"https:\/\/doi.org\/10.1007\/s12532-014-0068-9","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,12]]}}}