Timo Berthold

From MaRDI portal
Person:522266

Available identifiers

zbMath Open berthold.timoMaRDI QIDQ522266

List of research outcomes





PublicationDate of PublicationType
The MIP workshop 2023 computational competition on reoptimization2024-08-21Paper
Using multiple reference vectors and objective scaling in the feasibility pump2024-04-24Paper
The MIP Workshop 2023 Computational Competition on Reoptimization2023-11-24Paper
Cutting plane selection with analytic centers and multiregression2023-10-04Paper
Progress in mathematical programming solvers from 2001 to 20202023-07-12Paper
Conflict-free learning for mixed integer programming2022-12-21Paper
Transferring information across restarts in MIP2022-08-30Paper
Learning to Use Local Cuts2022-06-23Paper
Computational aspects of infeasibility analysis in mixed integer programming2022-01-10Paper
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library2021-12-27Paper
The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers2021-08-11Paper
Conflict Analysis for MINLP2021-06-23Paper
An exploratory computational analysis of dual degeneracy in mixed-integer programming2021-01-20Paper
Structure-driven fix-and-propagate heuristics for mixed integer programming2020-02-17Paper
Ten years of feasibility pump, and counting2019-10-18Paper
Local rapid learning for integer programs2019-10-14Paper
A status report on conflict analysis in mixed integer nonlinear programming2019-10-14Paper
Local Rapid Learning for Integer Programs2019-02-07Paper
A Status Report on Conflict Analysis in Mixed Integer Nonlinear Programming2019-02-07Paper
Four Good Reasons to Use an Interior Point Solver Within a MIP Solver2018-10-09Paper
Parallelization of the FICO Xpress-Optimizer2018-05-03Paper
ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers2018-05-03Paper
From feasibility to improvement to proof: three phases of solving mixed-integer programs2018-05-03Paper
A computational study of primal heuristics inside an MI(NL)P solver2018-02-09Paper
Improving the Performance of MIP and MINLP Solvers by Integrated Heuristics2017-12-01Paper
Experiments with conflict analysis in mixed integer programming2017-08-04Paper
Three ideas for a feasibility pump for nonconvex MINLP2017-06-29Paper
Three enhancements for optimization-based bound tightening2017-04-28Paper
Shift-and-propagate2017-04-26Paper
Parallelization of the FICO Xpress-Optimizer2016-09-28Paper
A First Implementation of ParaXpress: Combining Internal and External Parallelization to Solve MIPs on Supercomputers2016-09-28Paper
Branching on Multi-aggregated Variables2016-07-25Paper
Rounding and Propagation Heuristics for Mixed Integer Programming2015-03-03Paper
RENS. The optimal rounding2014-10-06Paper
Undercover: a primal MINLP heuristic exploring a largest sub-MIP2014-06-02Paper
Measuring the impact of primal heuristics2014-05-15Paper
Cloud Branching2013-06-04Paper
Analyzing the computational impact of MIQCP solver components2013-03-11Paper
Extending a CIP Framework to Solve MIQCPs2012-07-10Paper
An Approximative Criterion for the Potential of Energetic Reasoning2011-05-12Paper
Heuristics of the Branch-Cut-and-Price-Framework SCIP2011-04-07Paper
Detecting Orbitopal Symmetries2011-04-07Paper
A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling2010-06-22Paper
Rapid Learning for Binary Programs2010-06-22Paper
Constraint Integer Programming: A New Approach to Integrate CP and MIP2008-05-27Paper
Improving the feasibility pump2008-02-22Paper
Tricks from the Trade for Large-Scale Markdown Pricing: Heuristic Cut Generation for Lagrangian DecompositionN/APaper

Research outcomes over time

This page was built for person: Timo Berthold