{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:05:58Z","timestamp":1781075158565,"version":"3.54.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,3,14]],"date-time":"2005-03-14T00:00:00Z","timestamp":1110758400000},"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":[[2005,9]]},"DOI":"10.1007\/s10107-004-0570-3","type":"journal-article","created":{"date-parts":[[2005,3,14]],"date-time":"2005-03-14T18:09:56Z","timestamp":1110823796000},"page":"91-104","source":"Crossref","is-referenced-by-count":328,"title":["The feasibility pump"],"prefix":"10.1007","volume":"104","author":[{"given":"Matteo","family":"Fischetti","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrea","family":"Lodi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,3,14]]},"reference":[{"key":"570_CR1","unstructured":"Achterberg, T., Koch, T., Martin, A.: The mixed integer programming library: MIPLIB 2003. http:\/\/miplib.zib.de."},{"key":"570_CR2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1287\/opre.49.2.207.13535","volume":"49","author":"Balas","year":"2001","unstructured":"Balas, E., Ceria, S., Dawande, M., Margot, F., Pataki, G.: OCTANE: A New Heuristic For Pure 0-1 Programs. Oper. Res. 49, 207\u2013225 (2001)","journal-title":"Oper. Res."},{"key":"570_CR3","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/mnsc.26.1.86","volume":"26","author":"Balas","year":"1980","unstructured":"Balas, E., Martin, C.H.: Pivot-And-Complement: A Heuristic For 0-1 Programming. Management Science 26, 86\u201396 (1980)","journal-title":"Management Science"},{"key":"570_CR4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.disopt.2004.03.001","volume":"1","author":"Balas","year":"2004","unstructured":"Balas, E., Schmieta, S., Wallace, C.: Pivot and Shift\u2013A Mixed Integer Programming Heuristic. Discrete Optimization 1, 3\u201312 (2004)","journal-title":"Discrete Optimization"},{"key":"570_CR5","unstructured":"Bixby, R.E.: Personal communication. 2003"},{"key":"570_CR6","unstructured":"Chinneck, J.W.: The constraint consesus method for finding approximately feasible points in nonlinear programs. Technical Report Carleton University, Ottawa, Ontario, Canada, October 2002"},{"key":"570_CR7","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","volume":"102","author":"Danna","year":"2005","unstructured":"Danna, E., Rothberg, E., Le Paper, C.: Exploring relaxation induced neighborhoods to improve MIP solutions. Mathematical Programming, 102, 71\u201390 (2005)","journal-title":"Mathematical Programming,"},{"key":"570_CR8","unstructured":"Double-Click sas.: Personal communication. 2001"},{"key":"570_CR9","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"Fischetti","year":"2003","unstructured":"Fischetti, M., Lodi, A.: Local Branching. Mathematical Programming 98, 23\u201347 (2003)","journal-title":"Mathematical Programming"},{"key":"570_CR10","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF00132504","volume":"2","author":"Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: General Purpose Heuristics For Integer Programming: Part I. J. Heuristics 2, 343\u2013358 (1997)","journal-title":"J. Heuristics"},{"key":"570_CR11","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1023\/A:1009631530787","volume":"3","author":"Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: General Purpose Heuristics For Integer Programming: Part II. J. Heuristics 3, 161\u2013179 (1997)","journal-title":"J. Heuristics"},{"key":"570_CR12","doi-asserted-by":"crossref","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publisher, Boston, Dordrecht, London, 1997","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"570_CR13","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1287\/opre.17.4.600","volume":"17","author":"Hillier","year":"1969","unstructured":"Hillier, F.S.: Effcient Heuristic Procedures For Integer Linear Programming With An Interior. Oper. Res. 17, 600\u2013637 (1969)","journal-title":"Oper. Res."},{"key":"570_CR14","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BFb0120691","volume":"2","author":"Ibaraki","year":"1974","unstructured":"Ibaraki, T., Ohashi, T., Mine, H.: A Heuristic Algorithm For Mixed-Integer Programming Problems. Mathematical Programming Study 2, 115\u2013136 (1974)","journal-title":"Mathematical Programming Study"},{"key":"570_CR15","unstructured":"G.W. Klau. Personal communication, 2002."},{"key":"570_CR16","unstructured":"L\u00f8kketangen, A.: Heuristics for 0-1 Mixed-Integer Programming. In: P.M. Pardalos, M.G.C. Resende (eds.), Handbook of Applied Optimization, Oxford University Press, 2002, pp. 474\u2013477"},{"key":"570_CR17","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1016\/S0377-2217(97)00295-6","volume":"106","author":"L\u00f8kketangen","year":"1998","unstructured":"L\u00f8kketangen, A., Glover, F.: Solving Zero\/One Mixed Integer Programming Problems Using Tabu Search. European J. Oper. Res. 106, 624\u2013658 (1998)","journal-title":"European J. Oper. Res."},{"key":"570_CR18","unstructured":"L\u00fcbbecke, M.: Personal communication. 2002"},{"key":"570_CR19","doi-asserted-by":"crossref","unstructured":"Miller, A.J.: Personal communication. 2003","DOI":"10.1016\/B978-075067701-1\/50016-X"},{"key":"570_CR20","unstructured":"Nediak, M., Eckstein, J.: Pivot, Cut, and Dive: A Heuristic for 0-1 Mixed Integer Programming. Research Report RRR 53-2001, RUTCOR, Rutgers University, October 2001"},{"key":"570_CR21","unstructured":"Patel, J., Chinneck, J.W.: Active-Constraint Variable Ordering for Faster Feasibility of Mixed Integer Linear Programs. Technical Report Carleton University, Ottawa, Ontario, Canada, November 2003"},{"key":"570_CR22","unstructured":"Rothberg, E.: Personal communication. 2002"},{"key":"570_CR23","unstructured":"Rothberg, E.: Personal communication. 2003"},{"key":"570_CR24","unstructured":"Spielberg, K., Guignard, M.: Sequential (Quasi) Hot Start Method for BB (0,1) Mixed Integer Programming. Wharton School Research Report, 2002"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0570-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-004-0570-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0570-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T09:13:39Z","timestamp":1586164419000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-004-0570-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3,14]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,9]]}},"alternative-id":["570"],"URL":"https:\/\/doi.org\/10.1007\/s10107-004-0570-3","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,3,14]]}}}