Rounding and Propagation Heuristics for Mixed Integer Programming. - Tobias Achterberg; Timo Berthold; Gregor Hendel (OR, 2011)

Enhancing MIP Branching Decisions by Using the Sample Variance of Pseudo Costs. - Gregor Hendel (CPAIOR, 2015)

Exploiting Solving Phases for Mixed-Integer Programs. - Gregor Hendel (OR, 2015)

Shift-and-Propagate. - Timo Berthold; Gregor Hendel (J. Heuristics, 2015)

Adaptive Algorithmic Behavior for Solving Mixed Integer Programs Using Bandit Algorithms. - Gregor Hendel; Matthias Miltenberger; Jakob Witzig (OR, 2018)

From feasibility to improvement to proof: three phases of solving mixed-integer programs. - Timo Berthold; Gregor Hendel; Thorsten Koch (Optim. Methods Softw., 2018)

Clairvoyant Restarts in Branch-and-Bound Search Using Online Tree-Size Estimation. - Daniel Anderson; Gregor Hendel; Pierre Le Bodic; Merlin Viernickel (AAAI, 2019)

Learning To Scale Mixed-Integer Programs. - Timo Berthold; Gregor Hendel (AAAI, 2021)

MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. - Ambros M. Gleixner; Gregor Hendel; Gerald Gamrath; Tobias Achterberg; Michael Bastubbe; Timo Berthold; Philipp M. Christophel; Kati Jarck; Thorsten Koch; Jeff T. Linderoth; Marco E. Lübbecke; Hans D. Mittelmann; et al. (Math. Program. Comput., 2021)

Transferring Information Across Restarts in MIP. - Timo Berthold; Gregor Hendel; Domenico Salvagnin (CPAIOR, 2022)

Estimating the Size of Branch-and-Bound Trees. - Gregor Hendel; Daniel Anderson; Pierre Le Bodic; Marc E. Pfetsch (INFORMS J. Comput., 2022)

Adaptive large neighborhood search for mixed integer programming. - Gregor Hendel (Math. Program. Comput., 2022)