Ten years of feasibility pump, and counting
The Feasibility Pump (fp) is probably the best-known primal heuristic for mixed-integer programming. The original work by Fischetti et al. (Math Program 104(1):91–104, 2005), which introduced the heuristic for 0–1 mixed-integer linear programs, has been succeeded by more than twenty follow-up public...
Uloženo v:
| Vydáno v: | EURO journal on computational optimization Ročník 7; číslo 1; s. 1 - 14 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Berlin/Heidelberg
Elsevier Ltd
01.03.2019
Springer Berlin Heidelberg Springer Nature B.V Elsevier |
| Témata: | |
| ISSN: | 2192-4406, 2192-4414 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | The Feasibility Pump (fp) is probably the best-known primal heuristic for mixed-integer programming. The original work by Fischetti et al. (Math Program 104(1):91–104, 2005), which introduced the heuristic for 0–1 mixed-integer linear programs, has been succeeded by more than twenty follow-up publications which improve the performance of the fp and extend it to other problem classes. Year 2015 was the tenth anniversary of the first fp publication. The present paper provides an overview of the diverse Feasibility Pump literature that has been presented over the last decade. |
|---|---|
| AbstractList | The Feasibility Pump (
fp
) is probably the best-known primal heuristic for mixed-integer programming. The original work by Fischetti et al. (Math Program 104(1):91–104,
2005
), which introduced the heuristic for 0–1 mixed-integer linear programs, has been succeeded by more than twenty follow-up publications which improve the performance of the
fp
and extend it to other problem classes. Year 2015 was the tenth anniversary of the first
fp
publication. The present paper provides an overview of the diverse Feasibility Pump literature that has been presented over the last decade. The Feasibility Pump (fp) is probably the best-known primal heuristic for mixed-integer programming. The original work by Fischetti et al. (Math Program 104(1):91–104, 2005), which introduced the heuristic for 0–1 mixed-integer linear programs, has been succeeded by more than twenty follow-up publications which improve the performance of the fp and extend it to other problem classes. Year 2015 was the tenth anniversary of the first fp publication. The present paper provides an overview of the diverse Feasibility Pump literature that has been presented over the last decade. |
| Author | Lodi, Andrea Berthold, Timo Salvagnin, Domenico |
| Author_xml | – sequence: 1 givenname: Timo surname: Berthold fullname: Berthold, Timo organization: Berlin, Germany – sequence: 2 givenname: Andrea orcidid: 0000-0001-9269-633X surname: Lodi fullname: Lodi, Andrea email: andrea.lodi@polymtl.ca organization: Montreal, Canada – sequence: 3 givenname: Domenico surname: Salvagnin fullname: Salvagnin, Domenico organization: University of Padova, Padua, Italy |
| BookMark | eNp9kU9rVDEUxYNUaK39AN09cKlPc_Pn5QVXUmwtFNzUdUjyboYM02RMMsJ8e1OfVHAxi5BwOb9zDzlvyFnKCQm5BvoRKFWfKvBJyZHC3A_Vo3pFLhhoNgoB4uzlTadzclXrllIKkirK5QV5_4hpOKItdchhCGhrdHEX23HYH572HwablsHnQ2oxbd6S18HuKl79vS_Jj9uvjzffxofvd_c3Xx5GL7lqI5uVVo7bmUm_BAaeS5DeBSkmKuhMndQ4O8f1opV03oF36EALcHTxARy_JPer75Lt1uxLfLLlaLKN5s8gl42xpUW_Q8MWxNAXzlIIYYWf-eQnVF5ZDRBg6V7vVq99yT8PWJvZ5kNJPb5hggquJw3spAq45pNQXHYVrCpfcq0Fw0s2oOa5CLMWYXoR5rkIozqj_mN8bLbFnFqxcXeSZCtZ-5a0wfIv0yno8wph7-dX7FD1EZPHJRb0rX9gPEH_Brfkrkw |
| CitedBy_id | crossref_primary_10_1016_j_cor_2025_107083 crossref_primary_10_1109_LCSYS_2023_3289062 crossref_primary_10_1007_s10107_020_01547_5 crossref_primary_10_1007_s11081_023_09834_8 crossref_primary_10_1109_TPWRS_2022_3146772 crossref_primary_10_1016_j_ejor_2024_06_005 crossref_primary_10_3390_a13040088 crossref_primary_10_1016_j_cor_2020_105175 crossref_primary_10_1109_ACCESS_2024_3361323 crossref_primary_10_1007_s10107_021_01656_9 crossref_primary_10_1016_j_ejor_2025_08_029 crossref_primary_10_1016_j_cor_2019_07_018 crossref_primary_10_1016_j_ejco_2023_100066 crossref_primary_10_1016_j_ejor_2024_11_018 |
| Cites_doi | 10.1007/s10589-015-9792-y 10.1016/j.cor.2013.09.008 10.1137/110855351 10.1007/BF02592064 10.1016/j.disopt.2006.10.011 10.1007/s12532-009-0007-3 10.3182/20090603-3-RU-2001.0190 10.1016/j.endm.2010.05.096 10.1007/s11590-016-1046-0 10.1137/16M1069687 10.1007/s10898-017-0560-7 10.1007/s10589-010-9350-6 10.1016/j.disopt.2006.10.004 10.1007/s10107-012-0555-6 10.1007/s11590-012-0552-y 10.1016/j.disopt.2006.10.001 10.1007/978-3-319-62395-5_46 10.1007/978-3-642-13193-6_30 10.1016/j.orl.2011.07.005 10.1016/j.dam.2013.06.018 10.1007/s10107-004-0570-3 10.1007/s10732-014-9266-x 10.1007/s10107-012-0608-x 10.1007/s10732-007-9021-7 10.1016/j.cor.2006.08.004 10.1007/s10107-003-0395-5 10.1016/j.ipl.2016.10.009 10.1007/978-3-642-30850-5_29 10.1007/s12532-014-0068-9 10.1007/s10107-008-0212-2 10.1002/nav.3800030109 10.1137/110823596 10.1007/BF01580428 |
| ContentType | Journal Article |
| Copyright | 2019 The author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO) Springer-Verlag GmbH Germany, part of Springer Nature and EURO - The Association of European Operational Research Societies 2018 EURO Journal on Computational Optimization is a copyright of Springer, (2018). All Rights Reserved. Springer-Verlag GmbH Germany, part of Springer Nature and EURO - The Association of European Operational Research Societies 2018. |
| Copyright_xml | – notice: 2019 The author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO) – notice: Springer-Verlag GmbH Germany, part of Springer Nature and EURO - The Association of European Operational Research Societies 2018 – notice: EURO Journal on Computational Optimization is a copyright of Springer, (2018). All Rights Reserved. – notice: Springer-Verlag GmbH Germany, part of Springer Nature and EURO - The Association of European Operational Research Societies 2018. |
| DBID | 6I. AAFTH AAYXX CITATION 3V. 7SC 7WY 7WZ 7XB 87Z 8AL 8BF 8FD 8FE 8FG 8FK 8FL ABUWG AFKRA ARAPS AXJJW AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FREBS FRNLG F~G GNUQQ HCIFZ JQ2 K60 K6~ K7- L.- L7M L~C L~D M0C M0N M0Q P5Z P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PYYUZ Q9U DOA |
| DOI | 10.1007/s13675-018-0109-7 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Computing Database (Alumni Edition) European Business Database (Alumni Edition) Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection Asian & European Business Collection (ProQuest) ProQuest Central Essentials ProQuest Central Business Premium Collection Technology Collection ProQuest One Community College ProQuest Central Korea Asian & European Business Collection (Alumni) Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ABI/INFORM Professional Advanced Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ABI/INFORM Global Computing Database European Business Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection Proquest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China ABI/INFORM Collection China ProQuest Central Basic DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef ProQuest Business Collection (Alumni Edition) ProQuest European Business Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Asian & European Business Collection Computer and Information Systems Abstracts SciTech Premium Collection ProQuest Central China ABI/INFORM Complete ProQuest One Applied & Life Sciences ProQuest Central (New) Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest Business Collection ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Central (Alumni Edition) ProQuest One Community College Asian & European Business Collection (Alumni) ProQuest Central ABI/INFORM Professional Advanced ProQuest European Business (Alumni Edition) ProQuest Central Korea Advanced Technologies Database with Aerospace ABI/INFORM Complete (Alumni Edition) ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Computing (Alumni Edition) ABI/INFORM China ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni) |
| DatabaseTitleList | ProQuest Business Collection (Alumni Edition) Computer and Information Systems Abstracts |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 2192-4414 |
| EndPage | 14 |
| ExternalDocumentID | oai_doaj_org_article_2deef28785444a4c836c6e7c7a911f1d 10_1007_s13675_018_0109_7 S219244062100109X |
| GroupedDBID | -EM 0R~ 0VY 203 30V 3V. 4.4 408 409 6I. 7WY 8FE 8FG 8FL 96X AAEDW AAFTH AAIAL AAJKR AARHV AARTL AATVU AAWCG AAXUO AAYIU AAYQN AAYTO AAZMS ABBXA ABDZT ABFGW ABFTV ABJNI ABJOX ABKCH ABQBU ABTEG ABTMW ABUWG ABXPI ACBMV ACBRV ACBYP ACGFS ACIPQ ACKNC ACMLO ACOKC ADHHG ADHIR ADINQ ADKPE ADMDM ADRFC ADURQ ADYFF ADZKW AEBTG AEGNC AEJHL AEJRE AEOHA AEPYU AETCA AEVTX AEXQZ AEXYK AFKRA AFLOW AFNRJ AFWTZ AFZKB AGAYW AGDGC AGGBP AGQMX AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AILAN AIMYW AITGF AJBLW AJRNO AKLTO AKQUC ALFXC ALMA_UNASSIGNED_HOLDINGS AMKLP AMRAJ AMYQR ANMIH ARAPS ASPBG AUKKA AVWKF AVXWI AXJJW AXYYD AYQZM AZFZN AZQEC BAPOH BENPR BEZIV BGLVJ BGNMA BPHCQ CCPQU CSCUP DWQXO EBLON EBS EIOEI EJD ESBYG FDB FEDTE FERAY FINBP FNLPD FRNLG FRRFC FSGXE FYJPI GGRSB GJIRD GNUQQ GQ6 GROUPED_DOAJ HCIFZ HF~ HMJXF HQYDN HRMNR HVGLF HZ~ I0C IXD J-C JBSCW JCJTX K60 K6V K6~ K7- KOV M0C M0N M4Y NB0 NQJWS NU0 O9- O93 O9G O9J OK1 P62 PQBIZ PQQKQ PROAC RLLFE ROL RSV SHX SISQX SNX SOJ SPISZ STPWE TSG UG4 UOJIU UTJUX UZXMN VFIZW W48 AALRI AFBBN AJZVZ ZMTXR AAYWO AAYXX ABFSG ACSTC ACVFH ADCNI ADVLN AEUPX AEZWR AFFHD AFHIU AFPUW AHWEU AIGII AITUG AIXLP AKBMS AKRWK AKYEP APXCP CITATION PHGZM PHGZT PQBZA PQGLB 7SC 7XB 8AL 8BF 8FD 8FK JQ2 L.- L7M L~C L~D M0Q PKEHL PQEST PQUKI PRINS Q9U |
| ID | FETCH-LOGICAL-c537t-28797b3a825cdf21c3515cbf54604080b59e8bb39d975bcb1cbeb1941b0dcf1b3 |
| IEDL.DBID | DOA |
| ISICitedReferencesCount | 16 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000460834100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 2192-4406 |
| IngestDate | Fri Oct 03 12:41:47 EDT 2025 Sun Oct 05 00:26:27 EDT 2025 Fri Jul 25 08:22:52 EDT 2025 Wed Nov 05 20:47:15 EST 2025 Tue Nov 18 22:37:33 EST 2025 Fri Feb 21 02:34:51 EST 2025 Fri Feb 23 02:42:16 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Primal heuristics 90C59 Mixed-integer programming solvers 90C57 Mixed-integer programming 90C11 |
| Language | English |
| License | http://creativecommons.org/licenses/by-nc-nd/4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c537t-28797b3a825cdf21c3515cbf54604080b59e8bb39d975bcb1cbeb1941b0dcf1b3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 ObjectType-Literature Review-3 |
| ORCID | 0000-0001-9269-633X |
| OpenAccessLink | https://doaj.org/article/2deef28785444a4c836c6e7c7a911f1d |
| PQID | 2139364735 |
| PQPubID | 2034552 |
| PageCount | 14 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_2deef28785444a4c836c6e7c7a911f1d proquest_journals_2404396912 proquest_journals_2139364735 crossref_primary_10_1007_s13675_018_0109_7 crossref_citationtrail_10_1007_s13675_018_0109_7 springer_journals_10_1007_s13675_018_0109_7 elsevier_sciencedirect_doi_10_1007_s13675_018_0109_7 |
| PublicationCentury | 2000 |
| PublicationDate | 2019-03-01 |
| PublicationDateYYYYMMDD | 2019-03-01 |
| PublicationDate_xml | – month: 03 year: 2019 text: 2019-03-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Berlin/Heidelberg |
| PublicationPlace_xml | – name: Berlin/Heidelberg – name: Heidelberg |
| PublicationTitle | EURO journal on computational optimization |
| PublicationTitleAbbrev | EURO J Comput Optim |
| PublicationYear | 2019 |
| Publisher | Elsevier Ltd Springer Berlin Heidelberg Springer Nature B.V Elsevier |
| Publisher_xml | – name: Elsevier Ltd – name: Springer Berlin Heidelberg – name: Springer Nature B.V – name: Elsevier |
| References | Pesneau P, Sadykov R, Vanderbeck F (2012) Feasibility pump heuristics for column generation approaches. In: 11th International symposium on experimental algorithms (SEA 2012), pp 332–343 Bonami, Biegler, Conn, Cornuéjols, Grossmann, Laird, Lee, Lodi, Margot, Sawaya, Wächter (CR10) 2008; 5 Brearley, Mitra, Williams (CR14) 1975; 8 Guyon, Lemaire, Pinson, Rivreau (CR32) 2009; 42 Naoum-Sawaya (CR36) 2013; 43 D’Ambrosio, Frangioni, Liberti, Lodi (CR18) 2012; 136 Fischetti, Glover, Lodi (CR25) 2005; 104 Li, Liu (CR34) 2017; 118 D’Ambrosio, Frangioni, Liberti, Lodi (CR17) 2010 Fischetti, Salvagnin (CR29) 2009; 1 Boland, Eberhard, Engineer, Fischetti, Savelsbergh, Tsoukalas (CR8) 2014; 6 Sharma, Knudsen, Grimstad (CR43) 2014; 63 Bosco, Laganà, Musmanno, Vocaturo (CR13) 2013; 7 Fischetti, Monaci (CR28) 2014; 20 Achterberg T (2011) LP relaxation modification and cut selection in a MIP solver. US Patent, US20110131167 De Santis, Lucidi, Rinaldi (CR19) 2013; 23 Pal A, Charkhgard H (2017) A feasibility pump and local search based heuristic for bi-objective pure integer linear programming. Technical Report 5902, Optimization Online Baena, Castro (CR4) 2011; 39 Frank, Wolfe (CR30) 1956; 3 Perregaard M (2017) How MILP solvers can benefit from Interior Point solutions. Presentation slides from MIP 2017 workshop in Montréal. Misener, Floudas (CR35) 2012; 136 Boland, Eberhard, Engineer, Tsoukalas (CR9) 2012; 22 Bertacco, Fischetti, Lodi (CR6) 2007; 4 Bonami, Gonçalves (CR12) 2012; 51 Cafieri, D’Ambrosio (CR15) 2017; 71 Hanafi, Lazić, Mladenović (CR33) 2010; 36 Sonnevend (CR44) 1986 Bonami, Cornuéjols, Lodi, Margot (CR11) 2009; 119 Dey S, Iroume A, Molinaro M, Salvagnin D. Exploiting sparsity of MILPs by improving the randomization step in feasibility pump. SIAM J Optim (to appear) Requejo C, Santos E (2017) A feasibility pump and a local branching heuristics for the weight-constrained minimum spanning tree problem. In: Gervasi O, Murgante B, Misra S, Borruso G, Torre CM, Rocha AMA, Taniar D, Apduhan BO, Stankova E, Cuzzocrea A (eds) Computational science and its applications—ICCSA 2017: 17th international conference, Trieste, Italy, July 3–6, 2017, Proceedings, Part II, pp 669–683. Springer International Publishing, Cham Achterberg T (2010) LP basis selection and cutting planes. Presentation slides from MIP 2010 workshop in Atlanta. Vigerske S (2013) Decomposition in multistage stochastic programming and a constraint integer programming approach to mixed-integer nonlinear programming. Ph.D. Thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II Achterberg, Berthold (CR3) 2007; 4 Dey S (2017) Personal communication D’Ambrosio C (2009) Application-oriented mixed integer non-linear programming. Ph.D. Thesis, University of Bologna Schöning U (1999) A probabilistic algorithm for k-SAT and constraint satisfaction problems. In: FOCS: IEEE symposium on foundations of computer science (FOCS) Geißler, Morsi, Schewe, Schmidt (CR31) 2017; 27 Fischetti, Lodi (CR26) 2003; 98 Sharma S (2013) Mixed-integer nonlinear programming heuristics applied to a shale gas production optimization problem. Master’s Thesis. Norwegian University of Science and Technology De Santis, Lucidi, Rinaldi (CR20) 2014; 165 Duran, Grossmann (CR23) 1986; 36 Belotti, Berthold (CR5) 2016; 11 Berthold, Salvagnin (CR7) 2013 Eckstein, Nediak (CR24) 2007; 13 Fischetti, Lodi (CR27) 2008; 35 BolandNLEberhardACEngineerFGFischettiMSavelsberghMWPTsoukalasABoosting the feasibility pumpMath Program Comput20146325527910.1007/s12532-014-0068-9 FrankMWolfePAn algorithm for quadratic programmingNaval Res Logist Q195631–29511010.1002/nav.3800030109 BaenaDCastroJUsing the analytic center in the feasibility pumpOper Res Lett201139531031710.1016/j.orl.2011.07.005 EcksteinJNediakMPivot, cut, and dive: a heuristic for 0–1 mixed integer programmingJ Heuristics200713547150310.1007/s10732-007-9021-7 Perregaard M (2017) How MILP solvers can benefit from Interior Point solutions. Presentation slides from MIP 2017 workshop in Montréal. https://sites.google.com/site/mipworkshop2017/home BelottiPBertholdTThree ideas for a feasibility pump for nonconvex MINLPOptim Lett201611131510.1007/s11590-016-1046-0 FischettiMLodiALocal branchingMath Program2003981–3234710.1007/s10107-003-0395-5 SharmaSKnudsenBRGrimstadBTowards an objective feasibility pump for convex MINLPsComput Optim Appl201463373775310.1007/s10589-015-9792-y D’AmbrosioCFrangioniALibertiLLodiAFestaPExperiments with a feasibility pump approach for nonconvex MINLPsExperimental algorithms. Lecture notes in computer science2010Berlin HeidelbergSpringer350360 D’AmbrosioCFrangioniALibertiLLodiAA storm of feasibility pumps for nonconvex MINLPMath Program201213637540210.1007/s10107-012-0608-x BertaccoLFischettiMLodiAA feasibility pump heuristic for general mixed-integer problemsDiscrete Optim Spec Issue200741637610.1016/j.disopt.2006.10.001 FischettiMMonaciMProximity search for 0–1 mixed-integer convex programmingJ Heuristics201420670973110.1007/s10732-014-9266-x BertholdTSalvagninDGomesCSellmannMCloud branchingIntegration of AI and OR techniques in constraint programming for combinatorial optimization problems. Lecture notes in computer science2013BerlinSpringer284310.1007/978-3-642-38171-3_3 CafieriSD’AmbrosioCFeasibility pump for aircraft deconfliction with speed regulationJ Glob Optim201771350151510.1007/s10898-017-0560-7 GuyonOLemairePPinsonERivreauDNear optimal and optimal solutions for an integrated employee timetabling and production scheduling problemIFAC Proc Vol20094241523152810.3182/20090603-3-RU-2001.0190 Naoum-SawayaJRecursive central rounding for mixed integer programsComput Oper Res20134319120010.1016/j.cor.2013.09.008 FischettiMSalvagninDFeasibility pump 2.0Math Program Comput2009120122210.1007/s12532-009-0007-3 De SantisMLucidiSRinaldiFFeasibility pump-like heuristics for mixed integer problemsDiscrete Appl Math201416515216710.1016/j.dam.2013.06.018 LiMLiuQInexact feasibility pump for mixed integer nonlinear programmingInf Process Lett201711811011610.1016/j.ipl.2016.10.009 BonamiPGonçalvesJHeuristics for convex mixed integer nonlinear programsComput Optim Appl20125172974710.1007/s10589-010-9350-6 BolandNLEberhardACEngineerFGTsoukalasAA new approach to the feasibility pump in mixed integer programmingSIAM J Optim201222383186110.1137/110823596 BonamiPBieglerLTConnARCornuéjolsGGrossmannIELairdCDLeeJLodiAMargotFSawayaNWächterAAn algorithmic framework for convex mixed integer nonlinear programsDiscrete Optim2008518620410.1016/j.disopt.2006.10.011 BonamiPCornuéjolsGLodiAMargotFA feasibility pump for mixed integer nonlinear programsMath Program2009119233135210.1007/s10107-008-0212-2 AchterbergTBertholdTImproving the feasibility pumpDiscrete Optim Spec Issue200741778610.1016/j.disopt.2006.10.004 FischettiMGloverFLodiAThe feasibility pumpMath Program200510419110410.1007/s10107-004-0570-3 Achterberg T (2010) LP basis selection and cutting planes. Presentation slides from MIP 2010 workshop in Atlanta. https://www.isye.gatech.edu/news-events/events/past-conferences/2010-mixed-integer-programming-workshop HanafiSLazićJMladenovićNVariable neighbourhood pump heuristic for 0–1 mixed integer programming feasibilityElectron Notes Discrete Math20103675976610.1016/j.endm.2010.05.096 SonnevendGPrékopaASzelezsáanJStrazickyBAn “analytical centre” for polyhedrons and new classes of global algorithms for linear (smooth, convex) programmingSystem modelling and optimization. Lecture notes in control and information sciences1986BerlinSpringer866875 GeißlerBMorsiAScheweLSchmidtMPenalty alternating direction methods for mixed-integer optimization: a new view on feasibility pumpsSIAM J Optim2017271611163610.1137/16M1069687 FischettiMLodiARepairing MIP infeasibility through local branchingComput Oper Res20083551436144510.1016/j.cor.2006.08.004 De SantisMLucidiSRinaldiFA new class of functions for measuring solution integrality in the feasibility pump approachSIAM J Optim20132331575160610.1137/110855351 BoscoALaganàDMusmannoRVocaturoFModeling and solving the mixed capacitated general routing problemOptim Lett2013771451146910.1007/s11590-012-0552-y BrearleyAMitraGWilliamsHAnalysis of mathematical programming problems prior to applying the simplex algorithmMath Program19758548310.1007/BF01580428 MisenerRFloudasCAGlobal optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxationsMath Program2012136115518210.1007/s10107-012-0555-6 DuranMAGrossmannIEAn outer-approximation algorithm for a class of mixed-integer nonlinear programsMath Program198636330733910.1007/BF02592064 De Santis (10.1007/s13675-018-0109-7_CR19) 2013; 23 Bonami (10.1007/s13675-018-0109-7_CR11) 2009; 119 Fischetti (10.1007/s13675-018-0109-7_CR28) 2014; 20 Bertacco (10.1007/s13675-018-0109-7_CR6) 2007; 4 10.1007/s13675-018-0109-7_CR16 10.1007/s13675-018-0109-7_CR38 Bonami (10.1007/s13675-018-0109-7_CR10) 2008; 5 10.1007/s13675-018-0109-7_CR37 Bonami (10.1007/s13675-018-0109-7_CR12) 2012; 51 Sharma (10.1007/s13675-018-0109-7_CR43) 2014; 63 10.1007/s13675-018-0109-7_CR39 Belotti (10.1007/s13675-018-0109-7_CR5) 2016; 11 Boland (10.1007/s13675-018-0109-7_CR8) 2014; 6 Cafieri (10.1007/s13675-018-0109-7_CR15) 2017; 71 Guyon (10.1007/s13675-018-0109-7_CR32) 2009; 42 Berthold (10.1007/s13675-018-0109-7_CR7) 2013 Duran (10.1007/s13675-018-0109-7_CR23) 1986; 36 Eckstein (10.1007/s13675-018-0109-7_CR24) 2007; 13 Fischetti (10.1007/s13675-018-0109-7_CR26) 2003; 98 Frank (10.1007/s13675-018-0109-7_CR30) 1956; 3 Fischetti (10.1007/s13675-018-0109-7_CR29) 2009; 1 Naoum-Sawaya (10.1007/s13675-018-0109-7_CR36) 2013; 43 Brearley (10.1007/s13675-018-0109-7_CR14) 1975; 8 Achterberg (10.1007/s13675-018-0109-7_CR3) 2007; 4 Geißler (10.1007/s13675-018-0109-7_CR31) 2017; 27 Li (10.1007/s13675-018-0109-7_CR34) 2017; 118 Sonnevend (10.1007/s13675-018-0109-7_CR44) 1986 10.1007/s13675-018-0109-7_CR45 10.1007/s13675-018-0109-7_CR22 Fischetti (10.1007/s13675-018-0109-7_CR27) 2008; 35 Fischetti (10.1007/s13675-018-0109-7_CR25) 2005; 104 Hanafi (10.1007/s13675-018-0109-7_CR33) 2010; 36 Bosco (10.1007/s13675-018-0109-7_CR13) 2013; 7 Boland (10.1007/s13675-018-0109-7_CR9) 2012; 22 10.1007/s13675-018-0109-7_CR1 10.1007/s13675-018-0109-7_CR2 Misener (10.1007/s13675-018-0109-7_CR35) 2012; 136 D’Ambrosio (10.1007/s13675-018-0109-7_CR18) 2012; 136 10.1007/s13675-018-0109-7_CR41 D’Ambrosio (10.1007/s13675-018-0109-7_CR17) 2010 10.1007/s13675-018-0109-7_CR40 10.1007/s13675-018-0109-7_CR21 10.1007/s13675-018-0109-7_CR42 Baena (10.1007/s13675-018-0109-7_CR4) 2011; 39 De Santis (10.1007/s13675-018-0109-7_CR20) 2014; 165 |
| References_xml | – volume: 11 start-page: 3 year: 2016 end-page: 15 ident: CR5 article-title: Three ideas for a feasibility pump for nonconvex MINLP publication-title: Optim Lett – volume: 42 start-page: 1523 year: 2009 end-page: 1528 ident: CR32 article-title: Near optimal and optimal solutions for an integrated employee timetabling and production scheduling problem publication-title: IFAC Proc Vol – start-page: 350 year: 2010 end-page: 360 ident: CR17 article-title: Experiments with a feasibility pump approach for nonconvex MINLPs publication-title: Experimental algorithms. Lecture notes in computer science – reference: Pal A, Charkhgard H (2017) A feasibility pump and local search based heuristic for bi-objective pure integer linear programming. Technical Report 5902, Optimization Online – volume: 136 start-page: 155 year: 2012 end-page: 182 ident: CR35 article-title: Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations publication-title: Math Program – volume: 36 start-page: 307 year: 1986 end-page: 339 ident: CR23 article-title: An outer-approximation algorithm for a class of mixed-integer nonlinear programs publication-title: Math Program – reference: Pesneau P, Sadykov R, Vanderbeck F (2012) Feasibility pump heuristics for column generation approaches. In: 11th International symposium on experimental algorithms (SEA 2012), pp 332–343 – volume: 7 start-page: 1451 year: 2013 end-page: 1469 ident: CR13 article-title: Modeling and solving the mixed capacitated general routing problem publication-title: Optim Lett – volume: 23 start-page: 1575 year: 2013 end-page: 1606 ident: CR19 article-title: A new class of functions for measuring solution integrality in the feasibility pump approach publication-title: SIAM J Optim – start-page: 866 year: 1986 end-page: 875 ident: CR44 article-title: An “analytical centre” for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming publication-title: System modelling and optimization. Lecture notes in control and information sciences – volume: 39 start-page: 310 year: 2011 end-page: 317 ident: CR4 article-title: Using the analytic center in the feasibility pump publication-title: Oper Res Lett – volume: 119 start-page: 331 year: 2009 end-page: 352 ident: CR11 article-title: A feasibility pump for mixed integer nonlinear programs publication-title: Math Program – reference: Dey S (2017) Personal communication – volume: 4 start-page: 77 year: 2007 end-page: 86 ident: CR3 article-title: Improving the feasibility pump publication-title: Discrete Optim Spec Issue – reference: Achterberg T (2011) LP relaxation modification and cut selection in a MIP solver. US Patent, US20110131167 – reference: Perregaard M (2017) How MILP solvers can benefit from Interior Point solutions. Presentation slides from MIP 2017 workshop in Montréal. – reference: D’Ambrosio C (2009) Application-oriented mixed integer non-linear programming. Ph.D. Thesis, University of Bologna – volume: 98 start-page: 23 year: 2003 end-page: 47 ident: CR26 article-title: Local branching publication-title: Math Program – volume: 20 start-page: 709 year: 2014 end-page: 731 ident: CR28 article-title: Proximity search for 0-1 mixed-integer convex programming publication-title: J Heuristics – volume: 27 start-page: 1611 year: 2017 end-page: 1636 ident: CR31 article-title: Penalty alternating direction methods for mixed-integer optimization: a new view on feasibility pumps publication-title: SIAM J Optim – start-page: 28 year: 2013 end-page: 43 ident: CR7 article-title: Cloud branching publication-title: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. Lecture notes in computer science – reference: Schöning U (1999) A probabilistic algorithm for k-SAT and constraint satisfaction problems. In: FOCS: IEEE symposium on foundations of computer science (FOCS) – volume: 3 start-page: 95 year: 1956 end-page: 110 ident: CR30 article-title: An algorithm for quadratic programming publication-title: Naval Res Logist Q – volume: 51 start-page: 729 year: 2012 end-page: 747 ident: CR12 article-title: Heuristics for convex mixed integer nonlinear programs publication-title: Comput Optim Appl – volume: 43 start-page: 191 year: 2013 end-page: 200 ident: CR36 article-title: Recursive central rounding for mixed integer programs publication-title: Comput Oper Res – reference: Achterberg T (2010) LP basis selection and cutting planes. Presentation slides from MIP 2010 workshop in Atlanta. – reference: Requejo C, Santos E (2017) A feasibility pump and a local branching heuristics for the weight-constrained minimum spanning tree problem. In: Gervasi O, Murgante B, Misra S, Borruso G, Torre CM, Rocha AMA, Taniar D, Apduhan BO, Stankova E, Cuzzocrea A (eds) Computational science and its applications—ICCSA 2017: 17th international conference, Trieste, Italy, July 3–6, 2017, Proceedings, Part II, pp 669–683. Springer International Publishing, Cham – volume: 35 start-page: 1436 year: 2008 end-page: 1445 ident: CR27 article-title: Repairing MIP infeasibility through local branching publication-title: Comput Oper Res – reference: Dey S, Iroume A, Molinaro M, Salvagnin D. Exploiting sparsity of MILPs by improving the randomization step in feasibility pump. SIAM J Optim (to appear) – volume: 63 start-page: 737 year: 2014 end-page: 753 ident: CR43 article-title: Towards an objective feasibility pump for convex MINLPs publication-title: Comput Optim Appl – volume: 22 start-page: 831 year: 2012 end-page: 861 ident: CR9 article-title: A new approach to the feasibility pump in mixed integer programming publication-title: SIAM J Optim – volume: 6 start-page: 255 year: 2014 end-page: 279 ident: CR8 article-title: Boosting the feasibility pump publication-title: Math Program Comput – volume: 71 start-page: 501 year: 2017 end-page: 515 ident: CR15 article-title: Feasibility pump for aircraft deconfliction with speed regulation publication-title: J Glob Optim – volume: 5 start-page: 186 year: 2008 end-page: 204 ident: CR10 article-title: An algorithmic framework for convex mixed integer nonlinear programs publication-title: Discrete Optim – volume: 136 start-page: 375 year: 2012 end-page: 402 ident: CR18 article-title: A storm of feasibility pumps for nonconvex MINLP publication-title: Math Program – reference: Vigerske S (2013) Decomposition in multistage stochastic programming and a constraint integer programming approach to mixed-integer nonlinear programming. Ph.D. Thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II – volume: 4 start-page: 63 year: 2007 end-page: 76 ident: CR6 article-title: A feasibility pump heuristic for general mixed-integer problems publication-title: Discrete Optim Spec Issue – volume: 8 start-page: 54 year: 1975 end-page: 83 ident: CR14 article-title: Analysis of mathematical programming problems prior to applying the simplex algorithm publication-title: Math Program – reference: Sharma S (2013) Mixed-integer nonlinear programming heuristics applied to a shale gas production optimization problem. Master’s Thesis. Norwegian University of Science and Technology – volume: 13 start-page: 471 year: 2007 end-page: 503 ident: CR24 article-title: Pivot, cut, and dive: a heuristic for 0-1 mixed integer programming publication-title: J Heuristics – volume: 104 start-page: 91 year: 2005 end-page: 104 ident: CR25 article-title: The feasibility pump publication-title: Math Program – volume: 165 start-page: 152 year: 2014 end-page: 167 ident: CR20 article-title: Feasibility pump-like heuristics for mixed integer problems publication-title: Discrete Appl Math – volume: 1 start-page: 201 year: 2009 end-page: 222 ident: CR29 article-title: Feasibility pump 2.0 publication-title: Math Program Comput – volume: 118 start-page: 110 year: 2017 end-page: 116 ident: CR34 article-title: Inexact feasibility pump for mixed integer nonlinear programming publication-title: Inf Process Lett – volume: 36 start-page: 759 year: 2010 end-page: 766 ident: CR33 article-title: Variable neighbourhood pump heuristic for 0-1 mixed integer programming feasibility publication-title: Electron Notes Discrete Math – reference: MisenerRFloudasCAGlobal optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxationsMath Program2012136115518210.1007/s10107-012-0555-6 – reference: AchterbergTBertholdTImproving the feasibility pumpDiscrete Optim Spec Issue200741778610.1016/j.disopt.2006.10.004 – reference: FischettiMGloverFLodiAThe feasibility pumpMath Program200510419110410.1007/s10107-004-0570-3 – reference: FischettiMMonaciMProximity search for 0–1 mixed-integer convex programmingJ Heuristics201420670973110.1007/s10732-014-9266-x – reference: LiMLiuQInexact feasibility pump for mixed integer nonlinear programmingInf Process Lett201711811011610.1016/j.ipl.2016.10.009 – reference: De SantisMLucidiSRinaldiFA new class of functions for measuring solution integrality in the feasibility pump approachSIAM J Optim20132331575160610.1137/110855351 – reference: BolandNLEberhardACEngineerFGFischettiMSavelsberghMWPTsoukalasABoosting the feasibility pumpMath Program Comput20146325527910.1007/s12532-014-0068-9 – reference: BrearleyAMitraGWilliamsHAnalysis of mathematical programming problems prior to applying the simplex algorithmMath Program19758548310.1007/BF01580428 – reference: FischettiMLodiALocal branchingMath Program2003981–3234710.1007/s10107-003-0395-5 – reference: BertaccoLFischettiMLodiAA feasibility pump heuristic for general mixed-integer problemsDiscrete Optim Spec Issue200741637610.1016/j.disopt.2006.10.001 – reference: FrankMWolfePAn algorithm for quadratic programmingNaval Res Logist Q195631–29511010.1002/nav.3800030109 – reference: GuyonOLemairePPinsonERivreauDNear optimal and optimal solutions for an integrated employee timetabling and production scheduling problemIFAC Proc Vol20094241523152810.3182/20090603-3-RU-2001.0190 – reference: BertholdTSalvagninDGomesCSellmannMCloud branchingIntegration of AI and OR techniques in constraint programming for combinatorial optimization problems. Lecture notes in computer science2013BerlinSpringer284310.1007/978-3-642-38171-3_3 – reference: FischettiMLodiARepairing MIP infeasibility through local branchingComput Oper Res20083551436144510.1016/j.cor.2006.08.004 – reference: De SantisMLucidiSRinaldiFFeasibility pump-like heuristics for mixed integer problemsDiscrete Appl Math201416515216710.1016/j.dam.2013.06.018 – reference: SharmaSKnudsenBRGrimstadBTowards an objective feasibility pump for convex MINLPsComput Optim Appl201463373775310.1007/s10589-015-9792-y – reference: Achterberg T (2010) LP basis selection and cutting planes. Presentation slides from MIP 2010 workshop in Atlanta. https://www.isye.gatech.edu/news-events/events/past-conferences/2010-mixed-integer-programming-workshop – reference: GeißlerBMorsiAScheweLSchmidtMPenalty alternating direction methods for mixed-integer optimization: a new view on feasibility pumpsSIAM J Optim2017271611163610.1137/16M1069687 – reference: BelottiPBertholdTThree ideas for a feasibility pump for nonconvex MINLPOptim Lett201611131510.1007/s11590-016-1046-0 – reference: BaenaDCastroJUsing the analytic center in the feasibility pumpOper Res Lett201139531031710.1016/j.orl.2011.07.005 – reference: BonamiPCornuéjolsGLodiAMargotFA feasibility pump for mixed integer nonlinear programsMath Program2009119233135210.1007/s10107-008-0212-2 – reference: BonamiPBieglerLTConnARCornuéjolsGGrossmannIELairdCDLeeJLodiAMargotFSawayaNWächterAAn algorithmic framework for convex mixed integer nonlinear programsDiscrete Optim2008518620410.1016/j.disopt.2006.10.011 – reference: Naoum-SawayaJRecursive central rounding for mixed integer programsComput Oper Res20134319120010.1016/j.cor.2013.09.008 – reference: D’AmbrosioCFrangioniALibertiLLodiAA storm of feasibility pumps for nonconvex MINLPMath Program201213637540210.1007/s10107-012-0608-x – reference: EcksteinJNediakMPivot, cut, and dive: a heuristic for 0–1 mixed integer programmingJ Heuristics200713547150310.1007/s10732-007-9021-7 – reference: BonamiPGonçalvesJHeuristics for convex mixed integer nonlinear programsComput Optim Appl20125172974710.1007/s10589-010-9350-6 – reference: HanafiSLazićJMladenovićNVariable neighbourhood pump heuristic for 0–1 mixed integer programming feasibilityElectron Notes Discrete Math20103675976610.1016/j.endm.2010.05.096 – reference: SonnevendGPrékopaASzelezsáanJStrazickyBAn “analytical centre” for polyhedrons and new classes of global algorithms for linear (smooth, convex) programmingSystem modelling and optimization. Lecture notes in control and information sciences1986BerlinSpringer866875 – reference: DuranMAGrossmannIEAn outer-approximation algorithm for a class of mixed-integer nonlinear programsMath Program198636330733910.1007/BF02592064 – reference: FischettiMSalvagninDFeasibility pump 2.0Math Program Comput2009120122210.1007/s12532-009-0007-3 – reference: Perregaard M (2017) How MILP solvers can benefit from Interior Point solutions. Presentation slides from MIP 2017 workshop in Montréal. https://sites.google.com/site/mipworkshop2017/home – reference: CafieriSD’AmbrosioCFeasibility pump for aircraft deconfliction with speed regulationJ Glob Optim201771350151510.1007/s10898-017-0560-7 – reference: BolandNLEberhardACEngineerFGTsoukalasAA new approach to the feasibility pump in mixed integer programmingSIAM J Optim201222383186110.1137/110823596 – reference: BoscoALaganàDMusmannoRVocaturoFModeling and solving the mixed capacitated general routing problemOptim Lett2013771451146910.1007/s11590-012-0552-y – reference: D’AmbrosioCFrangioniALibertiLLodiAFestaPExperiments with a feasibility pump approach for nonconvex MINLPsExperimental algorithms. Lecture notes in computer science2010Berlin HeidelbergSpringer350360 – ident: 10.1007/s13675-018-0109-7_CR37 – volume: 63 start-page: 737 issue: 3 year: 2014 ident: 10.1007/s13675-018-0109-7_CR43 article-title: Towards an objective feasibility pump for convex MINLPs publication-title: Comput Optim Appl doi: 10.1007/s10589-015-9792-y – start-page: 28 year: 2013 ident: 10.1007/s13675-018-0109-7_CR7 article-title: Cloud branching – volume: 43 start-page: 191 year: 2013 ident: 10.1007/s13675-018-0109-7_CR36 article-title: Recursive central rounding for mixed integer programs publication-title: Comput Oper Res doi: 10.1016/j.cor.2013.09.008 – ident: 10.1007/s13675-018-0109-7_CR16 – volume: 23 start-page: 1575 issue: 3 year: 2013 ident: 10.1007/s13675-018-0109-7_CR19 article-title: A new class of functions for measuring solution integrality in the feasibility pump approach publication-title: SIAM J Optim doi: 10.1137/110855351 – volume: 36 start-page: 307 issue: 3 year: 1986 ident: 10.1007/s13675-018-0109-7_CR23 article-title: An outer-approximation algorithm for a class of mixed-integer nonlinear programs publication-title: Math Program doi: 10.1007/BF02592064 – ident: 10.1007/s13675-018-0109-7_CR41 – volume: 5 start-page: 186 year: 2008 ident: 10.1007/s13675-018-0109-7_CR10 article-title: An algorithmic framework for convex mixed integer nonlinear programs publication-title: Discrete Optim doi: 10.1016/j.disopt.2006.10.011 – volume: 1 start-page: 201 year: 2009 ident: 10.1007/s13675-018-0109-7_CR29 article-title: Feasibility pump 2.0 publication-title: Math Program Comput doi: 10.1007/s12532-009-0007-3 – volume: 42 start-page: 1523 issue: 4 year: 2009 ident: 10.1007/s13675-018-0109-7_CR32 article-title: Near optimal and optimal solutions for an integrated employee timetabling and production scheduling problem publication-title: IFAC Proc Vol doi: 10.3182/20090603-3-RU-2001.0190 – ident: 10.1007/s13675-018-0109-7_CR1 – volume: 36 start-page: 759 year: 2010 ident: 10.1007/s13675-018-0109-7_CR33 article-title: Variable neighbourhood pump heuristic for 0-1 mixed integer programming feasibility publication-title: Electron Notes Discrete Math doi: 10.1016/j.endm.2010.05.096 – volume: 11 start-page: 3 issue: 1 year: 2016 ident: 10.1007/s13675-018-0109-7_CR5 article-title: Three ideas for a feasibility pump for nonconvex MINLP publication-title: Optim Lett doi: 10.1007/s11590-016-1046-0 – volume: 27 start-page: 1611 year: 2017 ident: 10.1007/s13675-018-0109-7_CR31 article-title: Penalty alternating direction methods for mixed-integer optimization: a new view on feasibility pumps publication-title: SIAM J Optim doi: 10.1137/16M1069687 – volume: 71 start-page: 501 issue: 3 year: 2017 ident: 10.1007/s13675-018-0109-7_CR15 article-title: Feasibility pump for aircraft deconfliction with speed regulation publication-title: J Glob Optim doi: 10.1007/s10898-017-0560-7 – volume: 51 start-page: 729 year: 2012 ident: 10.1007/s13675-018-0109-7_CR12 article-title: Heuristics for convex mixed integer nonlinear programs publication-title: Comput Optim Appl doi: 10.1007/s10589-010-9350-6 – ident: 10.1007/s13675-018-0109-7_CR21 – volume: 4 start-page: 77 issue: 1 year: 2007 ident: 10.1007/s13675-018-0109-7_CR3 article-title: Improving the feasibility pump publication-title: Discrete Optim Spec Issue doi: 10.1016/j.disopt.2006.10.004 – volume: 136 start-page: 155 issue: 1 year: 2012 ident: 10.1007/s13675-018-0109-7_CR35 article-title: Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations publication-title: Math Program doi: 10.1007/s10107-012-0555-6 – volume: 7 start-page: 1451 issue: 7 year: 2013 ident: 10.1007/s13675-018-0109-7_CR13 article-title: Modeling and solving the mixed capacitated general routing problem publication-title: Optim Lett doi: 10.1007/s11590-012-0552-y – volume: 4 start-page: 63 issue: 1 year: 2007 ident: 10.1007/s13675-018-0109-7_CR6 article-title: A feasibility pump heuristic for general mixed-integer problems publication-title: Discrete Optim Spec Issue doi: 10.1016/j.disopt.2006.10.001 – ident: 10.1007/s13675-018-0109-7_CR42 – ident: 10.1007/s13675-018-0109-7_CR40 doi: 10.1007/978-3-319-62395-5_46 – start-page: 350 year: 2010 ident: 10.1007/s13675-018-0109-7_CR17 article-title: Experiments with a feasibility pump approach for nonconvex MINLPs doi: 10.1007/978-3-642-13193-6_30 – volume: 39 start-page: 310 issue: 5 year: 2011 ident: 10.1007/s13675-018-0109-7_CR4 article-title: Using the analytic center in the feasibility pump publication-title: Oper Res Lett doi: 10.1016/j.orl.2011.07.005 – volume: 165 start-page: 152 year: 2014 ident: 10.1007/s13675-018-0109-7_CR20 article-title: Feasibility pump-like heuristics for mixed integer problems publication-title: Discrete Appl Math doi: 10.1016/j.dam.2013.06.018 – volume: 104 start-page: 91 issue: 1 year: 2005 ident: 10.1007/s13675-018-0109-7_CR25 article-title: The feasibility pump publication-title: Math Program doi: 10.1007/s10107-004-0570-3 – volume: 20 start-page: 709 issue: 6 year: 2014 ident: 10.1007/s13675-018-0109-7_CR28 article-title: Proximity search for 0-1 mixed-integer convex programming publication-title: J Heuristics doi: 10.1007/s10732-014-9266-x – ident: 10.1007/s13675-018-0109-7_CR38 – volume: 136 start-page: 375 year: 2012 ident: 10.1007/s13675-018-0109-7_CR18 article-title: A storm of feasibility pumps for nonconvex MINLP publication-title: Math Program doi: 10.1007/s10107-012-0608-x – volume: 13 start-page: 471 issue: 5 year: 2007 ident: 10.1007/s13675-018-0109-7_CR24 article-title: Pivot, cut, and dive: a heuristic for 0-1 mixed integer programming publication-title: J Heuristics doi: 10.1007/s10732-007-9021-7 – volume: 35 start-page: 1436 issue: 5 year: 2008 ident: 10.1007/s13675-018-0109-7_CR27 article-title: Repairing MIP infeasibility through local branching publication-title: Comput Oper Res doi: 10.1016/j.cor.2006.08.004 – volume: 98 start-page: 23 issue: 1-3 year: 2003 ident: 10.1007/s13675-018-0109-7_CR26 article-title: Local branching publication-title: Math Program doi: 10.1007/s10107-003-0395-5 – volume: 118 start-page: 110 year: 2017 ident: 10.1007/s13675-018-0109-7_CR34 article-title: Inexact feasibility pump for mixed integer nonlinear programming publication-title: Inf Process Lett doi: 10.1016/j.ipl.2016.10.009 – ident: 10.1007/s13675-018-0109-7_CR39 doi: 10.1007/978-3-642-30850-5_29 – start-page: 866 year: 1986 ident: 10.1007/s13675-018-0109-7_CR44 article-title: An “analytical centre” for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming – ident: 10.1007/s13675-018-0109-7_CR2 – volume: 6 start-page: 255 issue: 3 year: 2014 ident: 10.1007/s13675-018-0109-7_CR8 article-title: Boosting the feasibility pump publication-title: Math Program Comput doi: 10.1007/s12532-014-0068-9 – volume: 119 start-page: 331 issue: 2 year: 2009 ident: 10.1007/s13675-018-0109-7_CR11 article-title: A feasibility pump for mixed integer nonlinear programs publication-title: Math Program doi: 10.1007/s10107-008-0212-2 – ident: 10.1007/s13675-018-0109-7_CR45 – volume: 3 start-page: 95 issue: 1-2 year: 1956 ident: 10.1007/s13675-018-0109-7_CR30 article-title: An algorithm for quadratic programming publication-title: Naval Res Logist Q doi: 10.1002/nav.3800030109 – ident: 10.1007/s13675-018-0109-7_CR22 – volume: 22 start-page: 831 issue: 3 year: 2012 ident: 10.1007/s13675-018-0109-7_CR9 article-title: A new approach to the feasibility pump in mixed integer programming publication-title: SIAM J Optim doi: 10.1137/110823596 – volume: 8 start-page: 54 year: 1975 ident: 10.1007/s13675-018-0109-7_CR14 article-title: Analysis of mathematical programming problems prior to applying the simplex algorithm publication-title: Math Program doi: 10.1007/BF01580428 |
| SSID | ssj0001507035 |
| Score | 2.2257783 |
| SecondaryResourceType | review_article |
| Snippet | The Feasibility Pump (fp) is probably the best-known primal heuristic for mixed-integer programming. The original work by Fischetti et al. (Math Program... The Feasibility Pump ( fp ) is probably the best-known primal heuristic for mixed-integer programming. The original work by Fischetti et al. (Math Program... |
| SourceID | doaj proquest crossref springer elsevier |
| SourceType | Open Website Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 1 |
| SubjectTerms | 90C11 90C57 90C59 Business and Management Feasibility Integer programming Integers Management Science Mixed-integer programming Mixed-integer programming solvers Operations Management Operations Research Operations Research/Decision Theory Optimization Performance enhancement Primal heuristics Review |
| SummonAdditionalLinks | – databaseName: ABI/INFORM Global dbid: M0C link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwED7xGmDgjSgvZWCiWCSxHccTAgRiATGA1M2KHRshobS0BYl_zzl1aIugC2ucxHK-u_Nn-_IdwHHsmOGMUhLbzBKmqSBFLCRJc1-kpuBoR2VdbELc3-edjnwIG26DkFbZxMQ6UJdd4_fIz1KkKl7rnPLz3hvxVaP86WoooTEPi57Z-JS-u_hqvMfCvUH7LEb0y5QwnLyag8367zmKbBnX0j6bK5ZETE1NtYL_1Aw1wUB_HJrWc9HN2n9HsQ6rgYVGFyOz2YA5W23CyoQ24Ra0H20VfaIfDKKui5wtQh7tZ9RDCziNiqqMmkIT2_B0c_14dUtCZQViOBVDREJIoWmBy0NTujQxFGmN0Y6zDJ06jzWXNteaylIKro1OjMaYLlmi49K4RNMdWKi6ld2FSDjBrXSMakcZ0jFpMyMZzTNc2NGkyFsQNx9VmSA77qtfvKqxYLLHQSEOyuOgRAtOvh_pjTQ3Zt186ZH6vtHLZdcXuv1nFbxPpaW1Dgedc8ZYwUxOM5NZYUSBsd4lZQtYg7MKzGPEKPBVL7P6PmhQVsH1B2oM8e_NXs5IZjJJW9BuzGjc_Gdfe7P72odlpHJylB13AAvD_rs9hCXzMXwZ9I9qt_gCazUMSw priority: 102 providerName: ProQuest – databaseName: SpringerLink Standard dbid: RSV link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NT8MgFH_R6UEPfhun0_TgSW3SFihwVKPxtBidZjdSKBgT0y3bNNl_76Nr92HURK-FQvt4j_cDHr8HcBo5ahglJIxsakOqCQ-ziMswET5JTcZQj_Iy2QRvt0W3K--re9zDOtq9PpIsZ-rZZTeC4BaXvj74KpIhX4YV9HbC52t4eHyebawwr8U-dBGNMQkpeqz6NPO7Vhb8UUnbv-CW5mDnl5PS0gHdbv7r07dgo8KbweVEQbZhyRY7sD7HQrgL5x1bBGPU-GHQc4GzWRUxOw76ONYXQVbkQZ1SYg-ebm8613dhlUMhNIzwEcqcS65JhgtBk7skNgQBjNGO0RTNV0SaSSu0JjKXnGmjY6Nx9pY01lFuXKzJPjSKXmEPIOCOMysdJdoRisBL2tRISkSKSzgSZ6IJUS1JZSqCcZ_n4k3NqJG9HBTKQXk5KN6Es-kr_Qm7xm-Vr_zwTCt6YuzyQW_woio7U0lurcOfFoxSmlEjSGpSyw3PcFZ3cd4EWg-uqjDGBDtgU6-_9d2qFUFVRj5UCaJnT79P2PfFnrhIpjJOmnBe68Ws-Me-Dv9U-wjWEMPJSVhcCxqjwbs9hlXzMXodDk5K0_gEOuMB4w priority: 102 providerName: Springer Nature |
| Title | Ten years of feasibility pump, and counting |
| URI | https://dx.doi.org/10.1007/s13675-018-0109-7 https://link.springer.com/article/10.1007/s13675-018-0109-7 https://www.proquest.com/docview/2139364735 https://www.proquest.com/docview/2404396912 https://doaj.org/article/2deef28785444a4c836c6e7c7a911f1d |
| Volume | 7 |
| WOSCitedRecordID | wos000460834100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 2192-4414 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001507035 issn: 2192-4406 databaseCode: DOA dateStart: 20130101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 2192-4414 dateEnd: 20201031 omitProxy: false ssIdentifier: ssj0001507035 issn: 2192-4406 databaseCode: RSV dateStart: 20130501 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LS8QwEB58HfQgPnF9LD14UoNtkzTNUUURxWXxuXoJTZrAglRxV8F_76QPXcXHxUsKTdq0M5nMFzL5BmAzdMxwRikJbWIJ01SQLBSSxKlPUpNxHEd5mWxCdDpprye7I6m-fExYRQ9cCW43zq11COtTzhjLmElpYhIrjMjQTF2U-9kXXz6ymKrOB_uh7OMX0SJjwtBtNVua5bk5ijgZV9E-jiuURHxySiV3_yffNII9v2yXll7oaA5ma_gY7FWfPQ9jtliAmRFSwUXYvrRF8IoDeBA8uMDZrA6AfQ0eUXU7QVbkQZMhYgmujg4vD45JnRKBGE7FEEUopNA0w3WdyV0cGYp4xGjHWYLWmIaaS5tqTWUuBddGR0bjZCxZpMPcuEjTZZgoHgq7AoFwglvpGNWOMsRR0iZGMpomuCKjUZa2IGxkokzNF-7TVtyrD6ZjL0aFYlRejEq0YOv9kceKLOO3xvte0O8NPc91eQO1r2rtq7-03wLWqEnVkKGCAviq_m99rzcqVbXNDlSMYNiz6VP-fbXnIZKJjOIWbDej4KP6x75W_-M_12AakZqsgt_WYWL49Gw3YMq8DPuDpzaMi5vbNkzu9U5ObvC6f9jpnrdLi8DyVBAsz8IDLLv8Dsvzi-s3y98Gpw |
| linkProvider | Directory of Open Access Journals |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VFgk4UF4V2wf4ABeKRRLbcXxAiLZUrbasOCxSbyZ27KoSyi67C2j_VH9jx0ncbRHsrQeusWM7mW9e9ngG4FXiuRWcMZq43FFumKRlIhXNilCkphSIo6opNiEHg-L0VH1ZgYt4FyaEVUaZ2AjqamTDHvm7DE2VkOuciQ_jHzRUjQqnq7GERguLvpv_Rpdt-v74AOn7OssOPw33j2hXVYBaweQMVyGVNKxE18hWPkstQ5VujRc8R0AXiRHKFcYwVSkpjDWpNSjPFE9NUlmfGobj3oE1zgoZ-Kov6WJPRwQGClGTKAcyylFZxoPU5rYeQ-scffcQPZYoKm-owqZiwA2NeM3i_eOQttF9h-v_2197BA87K5t8bNniMay4-gk8uJZ78SnsDl1N5ri0KRl54l3ZxQnPyRgR_paUdUViIY1n8PVWVrsBq_Wods-BSC-FU54z4xlHc1O53Cokfo6OK0vLogdJJKK2XVr1UN3ju14khA5010h3HeiuZQ_eXL0ybnOKLOu8F5Bx1TGkA28ejCZnupMuOquc8_jRheCcl9wWLLe5k1aWqMt8WvWAR1zpzrJqLSYc6nzZ3NsRVboTbVO9gNTfm0O6JpWrNOvBboTtovmfc20un-sl3Dsafj7RJ8eD_hbcR7NVtZGA27A6m_x0O3DX_pqdTycvGpYk8O220XwJbpdp0Q |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1ZS8QwEB68EH3wFtezDz6pZdsmaZpHr0VRFsED30KTJiJId9ldhf33Tnq4q6ggvjZpQiczmW-ayTcA-4GlmlFC_MDExqeKcD8NuPCjxBWpSRnqUVYUm-DtdvL4KG6qOqf9Otu9PpIs7zQ4lqZ80Oxmtjm6-EYQ6GIY7BKxAuHzSZimLo_eheu3D6OfLMxptEtjRMOMfIreqz7Z_G6UT76poPD_5KLGIOiXU9PCGbUW__0ZS7BQ4VDvuFScZZgw-QrMj7ETrsLhncm9IVpC3-tYz5q0yqQdel3UgSMvzTOvLjWxBvet87vTC7-qreBrRvgA14ILrkiKAaLObBRqgsBGK8tojGadBIoJkyhFRCY4U1qFWuGuLmiogkzbUJF1mMo7udkAj1vOjLCUKEsoAjJhYi0oSWIM7UiYJg0IaqlKXRGPu_oXL3JEmezkIFEO0slB8gYcfLzSLVk3fut84pbqo6MjzC4edHpPsrI_GWXGWPzohFFKU6oTEuvYcM1T3O1tmDWA1gstK-xRYgoc6vm3ubdrpZCV8fdlhKja0fIT9n2zIzQSsQijBhzWOjJq_nGuzT_13oPZm7OWvL5sX23BHMI8UWbObcPUoPdqdmBGvw2e-73dwmLeAQfxDas |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Ten+years+of+feasibility+pump%2C+and+counting&rft.jtitle=EURO+journal+on+computational+optimization&rft.au=Berthold%2C+Timo&rft.au=Lodi%2C+Andrea&rft.au=Salvagnin%2C+Domenico&rft.date=2019-03-01&rft.issn=2192-4406&rft.volume=7&rft.issue=1&rft.spage=1&rft.epage=14&rft_id=info:doi/10.1007%2Fs13675-018-0109-7&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s13675_018_0109_7 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2192-4406&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2192-4406&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2192-4406&client=summon |