Heuristics of the Branch-Cut-and-Price-Framework SCIP. - Timo Berthold (OR, 2007)

Improving the feasibility pump. - Tobias Achterberg; Timo Berthold (Discret. Optim., 2007)

Constraint Integer Programming: A New Approach to Integrate CP and MIP. - Tobias Achterberg; Timo Berthold; Thorsten Koch; Kati Wolter (CPAIOR, 2008)

Hybrid Branching. - Tobias Achterberg; Timo Berthold (CPAIOR, 2009)

Nonlinear Pseudo-Boolean Optimization: Relaxation or Propagation?. - Timo Berthold; Stefan Heinz 001; Marc E. Pfetsch (SAT, 2009)

ParaSCIP: A Parallel Extension of SCIP. - Yuji Shinano; Tobias Achterberg; Timo Berthold; Stefan Heinz 001; Thorsten Koch (CHPC, 2010)

Rapid Learning for Binary Programs. - Timo Berthold; Thibaut Feydy; Peter J. Stuckey (CPAIOR, 2010)

A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling. - Timo Berthold; Stefan Heinz 001; Marco E. Lübbecke; Rolf H. Möhring; Jens Schulz (CPAIOR, 2010)

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

An Approximative Criterion for the Potential of Energetic Reasoning. - Timo Berthold; Stefan Heinz 001; Jens Schulz (TAPAS, 2011)

MIPLIB 2010. - Thorsten Koch; Tobias Achterberg; Erling Andersen; Oliver Bastert; Timo Berthold; Robert E. Bixby; Emilie Danna; Gerald Gamrath; Ambros M. Gleixner; Stefan Heinz 001; Andrea Lodi 001; Hans D. Mittelmann; et al. (Math. Program. Comput., 2011)

Cloud Branching. - Timo Berthold; Domenico Salvagnin (CPAIOR, 2013)

Primal MINLP Heuristics in a Nutshell. - Timo Berthold (OR, 2013)

Undercover Branching. - Timo Berthold; Ambros M. Gleixner (SEA, 2013)

Measuring the impact of primal heuristics. - Timo Berthold (Oper. Res. Lett., 2013)

Solving Hard MIPLIB2003 Problems with ParaSCIP on Supercomputers: An Update. - Yuji Shinano; Tobias Achterberg; Timo Berthold; Stefan Heinz 001; Thorsten Koch; Michael Winkler (IPDPS Workshops, 2014)

Undercover: a primal MINLP heuristic exploring a largest sub-MIP. - Timo Berthold; Ambros M. Gleixner (Math. Program., 2014)

RENS. - Timo Berthold (Math. Program. Comput., 2014)

Branching on Multi-aggregated Variables. - Gerald Gamrath; Anna Melchiori; Timo Berthold; Ambros M. Gleixner; Domenico Salvagnin (CPAIOR, 2015)

Improving the Performance of MIP and MINLP Solvers by Integrated Heuristics. - Timo Berthold (OR, 2015)

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

A First Implementation of ParaXpress: Combining Internal and External Parallelization to Solve MIPs on Supercomputers. - Yuji Shinano; Timo Berthold; Stefan Heinz 001 (ICMS, 2016)

Algorithms for discrete nonlinear optimization in FICO Xpress. - Pietro Belotti; Timo Berthold; Kelligton Neves (SAM, 2016)

Solving Open MIP Instances with ParaSCIP on Supercomputers Using up to 80, 000 Cores. - Yuji Shinano; Tobias Achterberg; Timo Berthold; Stefan Heinz 001; Thorsten Koch; Michael Winkler (IPDPS, 2016)

Experiments with Conflict Analysis in Mixed Integer Programming. - Jakob Witzig; Timo Berthold; Stefan Heinz 001 (CPAIOR, 2017)

Four Good Reasons to Use an Interior Point Solver Within a MIP Solver. - Timo Berthold; Michael Perregaard; Csaba Mészáros (OR, 2017)

Three enhancements for optimization-based bound tightening. - Ambros M. Gleixner; Timo Berthold; Benjamin Müller 002; Stefan Weltge (J. Glob. Optim., 2017)

Three ideas for a feasibility pump for nonconvex MINLP. - Pietro Belotti; Timo Berthold (Optim. Lett., 2017)

Parallel Solvers for Mixed Integer Linear Optimization. - Ted K. Ralphs; Yuji Shinano; Timo Berthold; Thorsten Koch (Handbook of Parallel Constraint Reasoning, 2018)

A computational study of primal heuristics inside an MI(NL)P solver. - Timo Berthold (J. Glob. Optim., 2018)

Parallelization of the FICO Xpress-Optimizer. - Timo Berthold; James Farmer; Stefan Heinz 001; Michael Perregaard (Optim. Methods Softw., 2018)

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

ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers. - Yuji Shinano; Timo Berthold; Stefan Heinz 001 (Optim. Methods Softw., 2018)

Local Rapid Learning for Integer Programs. - Timo Berthold; Peter J. Stuckey; Jakob Witzig (CPAIOR, 2019)

A Status Report on Conflict Analysis in Mixed Integer Nonlinear Programming. - Jakob Witzig; Timo Berthold; Stefan Heinz 001 (CPAIOR, 2019)

Ten years of feasibility pump, and counting. - Timo Berthold; Andrea Lodi 001; Domenico Salvagnin (EURO J. Comput. Optim., 2019)

Structure-driven fix-and-propagate heuristics for mixed integer programming. - Gerald Gamrath; Timo Berthold; Stefan Heinz 001; Michael Winkler (Math. Program. Comput., 2019)

Conflict-Free Learning for Mixed Integer Programming. - Jakob Witzig; Timo Berthold (CPAIOR, 2020)

An exploratory computational analysis of dual degeneracy in mixed-integer programming. - Gerald Gamrath; Timo Berthold; Domenico Salvagnin (EURO J. Comput. Optim., 2020)

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

Conflict Analysis for MINLP. - Timo Berthold; Jakob Witzig (INFORMS J. Comput., 2021)

The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers. - Timo Berthold; Zsolt Csizmadia (Math. Program., 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)

Computational aspects of infeasibility analysis in mixed integer programming. - Jakob Witzig; Timo Berthold; Stefan Heinz 001 (Math. Program. Comput., 2021)

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

Progress in mathematical programming solvers from 2001 to 2020. - Thorsten Koch; Timo Berthold; Jaap Pedersen; Charlie Vanaret (EURO J. Comput. Optim., 2022)

Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning. - Gioni Mexi; Timo Berthold; Ambros M. Gleixner; Jakob Nordström (CP, 2023)

Cutting Plane Selection with Analytic Centers and Multiregression. - Mark Turner 010; Timo Berthold; Mathieu Besançon; Thorsten Koch (CPAIOR, 2023)

Branching via Cutting Plane Selection: Improving Hybrid Branching. - Mark Turner 010; Timo Berthold; Mathieu Besançon; Thorsten Koch (CoRR, 2023)

A Context-Aware Cutting Plane Selection Algorithm for Mixed-Integer Programming. - Mark Turner 010; Timo Berthold; Mathieu Besançon (CoRR, 2023)

Using multiple reference vectors and objective scaling in the Feasibility Pump. - Gioni Mexi; Timo Berthold; Domenico Salvagnin (EURO J. Comput. Optim., 2023)

The MIP Workshop 2023 Computational Competition on reoptimization. - Suresh Bolusani; Mathieu Besançon; Ambros M. Gleixner; Timo Berthold; Claudia D'Ambrosio; Gonzalo Muñoz 001; Joseph Paat; Dimitri Thomopulos (Math. Program. Comput., 2024)