default search action
Timo Berthold
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j22]Suresh Bolusani
, Mathieu Besançon
The MIP Workshop 2023 Computational Competition on reoptimization. Math. Program. Comput. 16(2): 255-266 (2024) - 2023
- [j21]Gioni Mexi, Timo Berthold
Using multiple reference vectors and objective scaling in the Feasibility Pump. EURO J. Comput. Optim. 11: 100066 (2023) - [c28]Gioni Mexi, Timo Berthold, Ambros M. Gleixner
Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning. CP 2023: 27:1-27:19 - [c27]Mark Turner
Cutting Plane Selection with Analytic Centers and Multiregression. CPAIOR 2023: 52-68 - [i4]Mark Turner, Timo Berthold, Mathieu Besançon, Thorsten Koch:
Branching via Cutting Plane Selection: Improving Hybrid Branching. CoRR abs/2306.06050 (2023) - [i3]Mark Turner, Timo Berthold, Mathieu Besançon:
A Context-Aware Cutting Plane Selection Algorithm for Mixed-Integer Programming. CoRR abs/2307.07322 (2023) - [i2]Gioni Mexi, Timo Berthold, Ambros M. Gleixner, Jakob Nordström:
Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning. CoRR abs/2307.14166 (2023) - 2022
- [j20]Thorsten Koch
Progress in mathematical programming solvers from 2001 to 2020. EURO J. Comput. Optim. 10: 100031 (2022) - [c26]Timo Berthold
Transferring Information Across Restarts in MIP. CPAIOR 2022: 24-33 - [i1]Mark Turner, Timo Berthold, Mathieu Besançon, Thorsten Koch:
Cutting Plane Selection with Analytic Centers and Multiregression. CoRR abs/2212.07231 (2022) - 2021
- [j19]Timo Berthold
Conflict Analysis for MINLP. INFORMS J. Comput. 33(2): 421-435 (2021) - [j18]Timo Berthold
The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers. Math. Program. 188(2): 523-537 (2021) - [j17]Ambros M. Gleixner
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Math. Program. Comput. 13(3): 443-490 (2021) - [j16]Jakob Witzig
Computational aspects of infeasibility analysis in mixed integer programming. Math. Program. Comput. 13(4): 753-785 (2021) - [c25]Timo Berthold, Gregor Hendel:
Learning To Scale Mixed-Integer Programs. AAAI 2021: 3661-3668 - 2020
- [j15]Gerald Gamrath
An exploratory computational analysis of dual degeneracy in mixed-integer programming. EURO J. Comput. Optim. 8(3): 241-261 (2020) - [c24]Jakob Witzig, Timo Berthold:
Conflict-Free Learning for Mixed Integer Programming. CPAIOR 2020: 521-530
2010 – 2019
- 2019
- [j14]Timo Berthold, Andrea Lodi
Ten years of feasibility pump, and counting. EURO J. Comput. Optim. 7(1): 1-14 (2019) - [j13]Gerald Gamrath
Structure-driven fix-and-propagate heuristics for mixed integer programming. Math. Program. Comput. 11(4): 675-702 (2019) - [c23]Timo Berthold, Peter J. Stuckey, Jakob Witzig:
Local Rapid Learning for Integer Programs. CPAIOR 2019: 67-83 - [c22]Jakob Witzig, Timo Berthold, Stefan Heinz:
A Status Report on Conflict Analysis in Mixed Integer Nonlinear Programming. CPAIOR 2019: 84-94 - 2018
- [j12]Timo Berthold:
A computational study of primal heuristics inside an MI(NL)P solver. J. Glob. Optim. 70(1): 189-206 (2018) - [j11]Timo Berthold, Gregor Hendel, Thorsten Koch
From feasibility to improvement to proof: three phases of solving mixed-integer programs. Optim. Methods Softw. 33(3): 499-517 (2018) - [j10]Timo Berthold, James Farmer, Stefan Heinz, Michael Perregaard:
Parallelization of the FICO Xpress-Optimizer. Optim. Methods Softw. 33(3): 518-529 (2018) - [j9]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): 530-539 (2018) - [p1]Ted K. Ralphs, Yuji Shinano, Timo Berthold, Thorsten Koch:
Parallel Solvers for Mixed Integer Linear Optimization. Handbook of Parallel Constraint Reasoning 2018: 283-336 - 2017
- [j8]Ambros M. Gleixner
Three enhancements for optimization-based bound tightening. J. Glob. Optim. 67(4): 731-757 (2017) - [j7]Pietro Belotti
Three ideas for a feasibility pump for nonconvex MINLP. Optim. Lett. 11(1): 3-15 (2017) - [c21]Jakob Witzig
Experiments with Conflict Analysis in Mixed Integer Programming. CPAIOR 2017: 211-220 - [c20]Timo Berthold, Michael Perregaard, Csaba Mészáros:
Four Good Reasons to Use an Interior Point Solver Within a MIP Solver. OR 2017: 159-164 - 2016
- [c19]Timo Berthold, James Farmer, Stefan Heinz, Michael Perregaard:
Parallelization of the FICO Xpress-Optimizer. ICMS 2016: 251-258 - [c18]Yuji Shinano, Timo Berthold, Stefan Heinz:
A First Implementation of ParaXpress: Combining Internal and External Parallelization to Solve MIPs on Supercomputers. ICMS 2016: 308-316 - [c17]Pietro Belotti
Algorithms for discrete nonlinear optimization in FICO Xpress. SAM 2016: 1-5 - [c16]Yuji Shinano, Tobias Achterberg, Timo Berthold, Stefan Heinz, Thorsten Koch
Solving Open MIP Instances with ParaSCIP on Supercomputers Using up to 80, 000 Cores. IPDPS 2016: 770-779 - 2015
- [j6]Timo Berthold, Gregor Hendel:
Shift-and-Propagate. J. Heuristics 21(1): 73-106 (2015) - [c15]Gerald Gamrath
Branching on Multi-aggregated Variables. CPAIOR 2015: 141-156 - [c14]Timo Berthold:
Improving the Performance of MIP and MINLP Solvers by Integrated Heuristics. OR 2015: 19-24 - 2014
- [j5]Timo Berthold, Ambros M. Gleixner
Undercover: a primal MINLP heuristic exploring a largest sub-MIP. Math. Program. 144(1-2): 315-346 (2014) - [j4]Timo Berthold:
RENS. Math. Program. Comput. 6(1): 33-54 (2014) - [c13]Yuji Shinano, Tobias Achterberg, Timo Berthold, Stefan Heinz, Thorsten Koch
Solving Hard MIPLIB2003 Problems with ParaSCIP on Supercomputers: An Update. IPDPS Workshops 2014: 1552-1561 - 2013
- [j3]Timo Berthold:
Measuring the impact of primal heuristics. Oper. Res. Lett. 41(6): 611-614 (2013) - [c12]Timo Berthold, Domenico Salvagnin:
Cloud Branching. CPAIOR 2013: 28-43 - [c11]Timo Berthold:
Primal MINLP Heuristics in a Nutshell. OR 2013: 23-28 - [c10]Timo Berthold, Ambros M. Gleixner
Undercover Branching. SEA 2013: 212-223 - 2011
- [j2]Thorsten Koch
MIPLIB 2010. Math. Program. Comput. 3(2): 103-163 (2011) - [c9]Tobias Achterberg, Timo Berthold, Gregor Hendel:
Rounding and Propagation Heuristics for Mixed Integer Programming. OR 2011: 71-76 - [c8]Timo Berthold, Stefan Heinz, Jens Schulz:
An Approximative Criterion for the Potential of Energetic Reasoning. TAPAS 2011: 229-239 - 2010
- [c7]Yuji Shinano, Tobias Achterberg, Timo Berthold, Stefan Heinz, Thorsten Koch:
ParaSCIP: A Parallel Extension of SCIP. CHPC 2010: 135-148 - [c6]Timo Berthold, Thibaut Feydy, Peter J. Stuckey:
Rapid Learning for Binary Programs. CPAIOR 2010: 51-55 - [c5]Timo Berthold, Stefan Heinz, Marco E. Lübbecke
A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling. CPAIOR 2010: 313-317
2000 – 2009
- 2009
- [c4]Tobias Achterberg, Timo Berthold:
Hybrid Branching. CPAIOR 2009: 309-311 - [c3]Timo Berthold, Stefan Heinz, Marc E. Pfetsch
Nonlinear Pseudo-Boolean Optimization: Relaxation or Propagation?. SAT 2009: 441-446 - 2008
- [c2]Tobias Achterberg, Timo Berthold, Thorsten Koch
Constraint Integer Programming: A New Approach to Integrate CP and MIP. CPAIOR 2008: 6-20 - 2007
- [j1]Tobias Achterberg, Timo Berthold:
Improving the feasibility pump. Discret. Optim. 4(1): 77-86 (2007) - [c1]Timo Berthold:
Heuristics of the Branch-Cut-and-Price-Framework SCIP. OR 2007: 31-36
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: