Feasibility Pumping
Feasibility Pumping is a heuristic algorithmic framework in mathematical optimization that iteratively refines solutions by alternating between rounding fractional solutions to integer values and projecting infeasible solutions onto the feasible set to drive convergence toward a feasible solution of mixed-integer programming problems.
14
Publications
871
Citations
33
Authors
19
Institutions
Publications per year
2017–2026
5
Parents
14
Improving the feasibility pump
Tobias Achterberg, Timo Berthold · Discrete Optimization · 2006 · 172 citations
A Feasibility Pump for mixed integer nonlinear programs
Pierre Bonami, Gérard Cornuéjols, Andrea Lodi et al. · Mathematical Programming · 2008 · 119 citations · Full text
Primal Heuristics for Mixed Integer Programs
Timo Berthold · 2006 · 110 citations
Heuristic algorithms in global MINLP solvers
Timo Berthold · 2014 · 61 citations
1–5 of 14
33
4
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 33
19

University of Padua
Padua, Italy
3 h-index
4 publications
355 citations

Zuse Institute Berlin
Berlin, Germany
3 h-index
4 publications
486 citations
University of Newcastle Australia
Newcastle, Australia
2 h-index
4 publications
108 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
4 publications
302 citations

University of Bologna
Bologna, Italy
2 h-index
2 publications
269 citations
Guangxi University
Nanning, China
1 h-index
1 publications
35 citations
ExxonMobil (United States)
Irving, United States
1 h-index
1 publications
32 citations

Brunel University of London
London, United Kingdom
1 h-index
1 publications
25 citations
1–8 of 19
2 publications · 68 citations
2
h-index
2 publications · 322 citations
2
h-index
1 publications · 30 citations
1
h-index
1 publications · 25 citations
1
h-index
1 publications · 32 citations
1
h-index
1–5