Timo Berthold

Orcid: 0000-0002-6320-8154

According to our database1, Timo Berthold authored at least 52 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
The MIP Workshop 2023 Computational Competition on reoptimization.
Math. Program. Comput., June, 2024

2023
Using multiple reference vectors and objective scaling in the Feasibility Pump.
EURO J. Comput. Optim., January, 2023

A Context-Aware Cutting Plane Selection Algorithm for Mixed-Integer Programming.
CoRR, 2023

Branching via Cutting Plane Selection: Improving Hybrid Branching.
CoRR, 2023

Cutting Plane Selection with Analytic Centers and Multiregression.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2023

Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning.
Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming, 2023

2022
Progress in mathematical programming solvers from 2001 to 2020.
EURO J. Comput. Optim., 2022

Transferring Information Across Restarts in MIP.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2022

2021
Computational aspects of infeasibility analysis in mixed integer programming.
Math. Program. Comput., 2021

MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library.
Math. Program. Comput., 2021

The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers.
Math. Program., 2021

Conflict Analysis for MINLP.
INFORMS J. Comput., 2021

Learning To Scale Mixed-Integer Programs.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
An exploratory computational analysis of dual degeneracy in mixed-integer programming.
EURO J. Comput. Optim., 2020

Conflict-Free Learning for Mixed Integer Programming.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2020

2019
Structure-driven fix-and-propagate heuristics for mixed integer programming.
Math. Program. Comput., 2019

Ten years of feasibility pump, and counting.
EURO J. Comput. Optim., 2019

A Status Report on Conflict Analysis in Mixed Integer Nonlinear Programming.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2019

Local Rapid Learning for Integer Programs.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2019

2018
ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers.
Optim. Methods Softw., 2018

From feasibility to improvement to proof: three phases of solving mixed-integer programs.
Optim. Methods Softw., 2018

Parallelization of the FICO Xpress-Optimizer.
Optim. Methods Softw., 2018

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

Parallel Solvers for Mixed Integer Linear Optimization.
Proceedings of the Handbook of Parallel Constraint Reasoning., 2018

2017
Three ideas for a feasibility pump for nonconvex MINLP.
Optim. Lett., 2017

Three enhancements for optimization-based bound tightening.
J. Glob. Optim., 2017

Four Good Reasons to Use an Interior Point Solver Within a MIP Solver.
Proceedings of the Operations Research Proceedings 2017, 2017

Experiments with Conflict Analysis in Mixed Integer Programming.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2017

2016
Solving Open MIP Instances with ParaSCIP on Supercomputers Using up to 80, 000 Cores.
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016

Algorithms for discrete nonlinear optimization in FICO Xpress.
Proceedings of the 2016 IEEE Sensor Array and Multichannel Signal Processing Workshop (SAM), 2016

A First Implementation of ParaXpress: Combining Internal and External Parallelization to Solve MIPs on Supercomputers.
Proceedings of the Mathematical Software - ICMS 2016, 2016

2015
Shift-and-Propagate.
J. Heuristics, 2015

Improving the Performance of MIP and MINLP Solvers by Integrated Heuristics.
Proceedings of the Operations Research Proceedings 2015, 2015

Branching on Multi-aggregated Variables.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2015

2014
Math. Program. Comput., 2014

Undercover: a primal MINLP heuristic exploring a largest sub-MIP.
Math. Program., 2014

Solving Hard MIPLIB2003 Problems with ParaSCIP on Supercomputers: An Update.
Proceedings of the 2014 IEEE International Parallel & Distributed Processing Symposium Workshops, 2014

2013
Measuring the impact of primal heuristics.
Oper. Res. Lett., 2013

Undercover Branching.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Primal MINLP Heuristics in a Nutshell.
Proceedings of the Operations Research Proceedings 2013, 2013

Cloud Branching.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

2011
MIPLIB 2010.
Math. Program. Comput., 2011

An Approximative Criterion for the Potential of Energetic Reasoning.
Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

Rounding and Propagation Heuristics for Mixed Integer Programming.
Proceedings of the Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30, 2011

2010
A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2010

Rapid Learning for Binary Programs.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2010

ParaSCIP: A Parallel Extension of SCIP.
Proceedings of the Competence in High Performance Computing 2010, 2010

2009
Nonlinear Pseudo-Boolean Optimization: Relaxation or Propagation?.
Proceedings of the Theory and Applications of Satisfiability Testing, 2009

Hybrid Branching.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2009

2008
Constraint Integer Programming: A New Approach to Integrate CP and MIP.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2008

2007
Improving the feasibility pump.
Discret. Optim., 2007

Heuristics of the Branch-Cut-and-Price-Framework SCIP.
Proceedings of the Operations Research, 2007


  Loading...