Timo Berthold

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 33

Top Topics

Integer Programming

Integer Program

Top Venues

Math. Program. Comput.

EURO J. Comput. Optim.

Publications

Suresh Bolusani, Mathieu Besançon, Ambros M. Gleixner, Timo Berthold, Claudia D'Ambrosio, Gonzalo Muñoz, Joseph Paat, Dimitri Thomopulos
The MIP Workshop 2023 Computational Competition on reoptimization. Math. Program. Comput. 16 (2) (2024)
Mark Turner, Timo Berthold, Mathieu Besançon, Thorsten Koch
Cutting Plane Selection with Analytic Centers and Multiregression. CPAIOR (2023)
Mark Turner, Timo Berthold, Mathieu Besançon, Thorsten Koch
Branching via Cutting Plane Selection: Improving Hybrid Branching. CoRR (2023)
Gioni Mexi, Timo Berthold, Domenico Salvagnin
Using multiple reference vectors and objective scaling in the Feasibility Pump. EURO J. Comput. Optim. 11 (2023)
Gioni Mexi, Timo Berthold, Ambros M. Gleixner, Jakob Nordström
Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning. CP (2023)
Gioni Mexi, Timo Berthold, Ambros M. Gleixner, Jakob Nordström
Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning. CoRR (2023)
Mark Turner, Timo Berthold, Mathieu Besançon
A Context-Aware Cutting Plane Selection Algorithm for Mixed-Integer Programming. CoRR (2023)
Thorsten Koch, Timo Berthold, Jaap Pedersen, Charlie Vanaret
Progress in mathematical programming solvers from 2001 to 2020. EURO J. Comput. Optim. 10 (2022)
Mark Turner, Timo Berthold, Mathieu Besançon, Thorsten Koch
Cutting Plane Selection with Analytic Centers and Multiregression. CoRR (2022)
Timo Berthold, Gregor Hendel, Domenico Salvagnin
Transferring Information Across Restarts in MIP. CPAIOR (2022)
Timo Berthold, Gregor Hendel
Learning To Scale Mixed-Integer Programs. AAAI (2021)
Timo Berthold, Jakob Witzig
Conflict Analysis for MINLP. INFORMS J. Comput. 33 (2) (2021)
Jakob Witzig, Timo Berthold, Stefan Heinz
Computational aspects of infeasibility analysis in mixed integer programming. Math. Program. Comput. 13 (4) (2021)
Timo Berthold, Zsolt Csizmadia
The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers. Math. Program. 188 (2) (2021)
Ambros M. Gleixner, Gregor Hendel, Gerald Gamrath, Tobias Achterberg, Michael Bastubbe, Timo Berthold, Philipp Christophel, Kati Jarck, Thorsten Koch, Jeff T. Linderoth, Marco E. Lübbecke, Hans D. Mittelmann, Derya B. Özyurt, Ted K. Ralphs, Domenico Salvagnin, Yuji Shinano
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Math. Program. Comput. 13 (3) (2021)
Gerald Gamrath, Timo Berthold, Domenico Salvagnin
An exploratory computational analysis of dual degeneracy in mixed-integer programming. EURO J. Comput. Optim. 8 (3) (2020)
Jakob Witzig, Timo Berthold
Conflict-Free Learning for Mixed Integer Programming. CPAIOR (2020)
Jakob Witzig, Timo Berthold, Stefan Heinz
A Status Report on Conflict Analysis in Mixed Integer Nonlinear Programming. CPAIOR (2019)
Timo Berthold, Peter J. Stuckey, Jakob Witzig
Local Rapid Learning for Integer Programs. CPAIOR (2019)
Timo Berthold, Andrea Lodi, Domenico Salvagnin
Ten years of feasibility pump, and counting. EURO J. Comput. Optim. 7 (1) (2019)
Gerald Gamrath, Timo Berthold, Stefan Heinz, Michael Winkler
Structure-driven fix-and-propagate heuristics for mixed integer programming. Math. Program. Comput. 11 (4) (2019)
Timo Berthold, Gregor Hendel, Thorsten Koch
From feasibility to improvement to proof: three phases of solving mixed-integer programs. Optim. Methods Softw. 33 (3) (2018)
Timo Berthold
A computational study of primal heuristics inside an MI(NL)P solver. J. Glob. Optim. 70 (1) (2018)
Yuji Shinano, Timo Berthold, Stefan Heinz
ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers. Optim. Methods Softw. 33 (3) (2018)
Timo Berthold, James Farmer, Stefan Heinz, Michael Perregaard
Parallelization of the FICO Xpress-Optimizer. Optim. Methods Softw. 33 (3) (2018)
Timo Berthold, Michael Perregaard, Csaba Mészáros
Four Good Reasons to Use an Interior Point Solver Within a MIP Solver. OR (2017)
Pietro Belotti, Timo Berthold
Three ideas for a feasibility pump for nonconvex MINLP. Optim. Lett. 11 (1) (2017)
Jakob Witzig, Timo Berthold, Stefan Heinz
Experiments with Conflict Analysis in Mixed Integer Programming. CPAIOR (2017)
Ambros M. Gleixner, Timo Berthold, Benjamin Müller, Stefan Weltge
Three enhancements for optimization-based bound tightening. J. Glob. Optim. 67 (4) (2017)
Timo Berthold, James Farmer, Stefan Heinz, Michael Perregaard
Parallelization of the FICO Xpress-Optimizer. ICMS (2016)
Pietro Belotti, Timo Berthold, Kelligton Neves
Algorithms for discrete nonlinear optimization in FICO Xpress. SAM (2016)
Yuji Shinano, Tobias Achterberg, Timo Berthold, Stefan Heinz, Thorsten Koch, Michael Winkler
Solving Open MIP Instances with ParaSCIP on Supercomputers Using up to 80, 000 Cores. IPDPS (2016)
Yuji Shinano, Timo Berthold, Stefan Heinz
A First Implementation of ParaXpress: Combining Internal and External Parallelization to Solve MIPs on Supercomputers. ICMS (2016)
Gerald Gamrath, Anna Melchiori, Timo Berthold, Ambros M. Gleixner, Domenico Salvagnin
Branching on Multi-aggregated Variables. CPAIOR (2015)
Timo Berthold, Gregor Hendel
Shift-and-Propagate. J. Heuristics 21 (1) (2015)
Timo Berthold
Improving the Performance of MIP and MINLP Solvers by Integrated Heuristics. OR (2015)
Timo Berthold
RENS. Math. Program. Comput. 6 (1) (2014)
Timo Berthold, Ambros M. Gleixner
Undercover: a primal MINLP heuristic exploring a largest sub-MIP. Math. Program. 144 (1-2) (2014)
Yuji Shinano, Tobias Achterberg, Timo Berthold, Stefan Heinz, Thorsten Koch, Michael Winkler
Solving Hard MIPLIB2003 Problems with ParaSCIP on Supercomputers: An Update. IPDPS Workshops (2014)
Timo Berthold, Ambros M. Gleixner
Undercover Branching. SEA (2013)
Timo Berthold
Primal MINLP Heuristics in a Nutshell. OR (2013)
Timo Berthold
Measuring the impact of primal heuristics. Oper. Res. Lett. 41 (6) (2013)
Timo Berthold, Domenico Salvagnin
Cloud Branching. CPAIOR (2013)
Thorsten Koch, Tobias Achterberg, Erling Andersen, Oliver Bastert, Timo Berthold, Robert E. Bixby, Emilie Danna, Gerald Gamrath, Ambros M. Gleixner, Stefan Heinz, Andrea Lodi, Hans D. Mittelmann, Ted K. Ralphs, Domenico Salvagnin, Daniel E. Steffy, Kati Wolter
MIPLIB 2010. Math. Program. Comput. 3 (2) (2011)
Tobias Achterberg, Timo Berthold, Gregor Hendel
Rounding and Propagation Heuristics for Mixed Integer Programming. OR (2011)
Timo Berthold, Stefan Heinz, Jens Schulz
An Approximative Criterion for the Potential of Energetic Reasoning. TAPAS (2011)
Yuji Shinano, Tobias Achterberg, Timo Berthold, Stefan Heinz, Thorsten Koch
ParaSCIP: A Parallel Extension of SCIP. CHPC (2010)
Timo Berthold, Stefan Heinz, Marco E. Lübbecke, Rolf H. Möhring, Jens Schulz
A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling. CPAIOR (2010)
Timo Berthold, Thibaut Feydy, Peter J. Stuckey
Rapid Learning for Binary Programs. CPAIOR (2010)
Timo Berthold, Stefan Heinz, Marc E. Pfetsch
Nonlinear Pseudo-Boolean Optimization: Relaxation or Propagation?. SAT (2009)
Tobias Achterberg, Timo Berthold
Hybrid Branching. CPAIOR (2009)
Tobias Achterberg, Timo Berthold, Thorsten Koch, Kati Wolter
Constraint Integer Programming: A New Approach to Integrate CP and MIP. CPAIOR (2008)
Tobias Achterberg, Timo Berthold
Improving the feasibility pump. Discret. Optim. 4 (1) (2007)
Timo Berthold
Heuristics of the Branch-Cut-and-Price-Framework SCIP. OR (2007)