default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTobias Achterberg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c10]Ksenia Bestuzheva
, Ambros M. Gleixner, Tobias Achterberg:
Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Products. IPCO 2023: 14-28- 2021
- [j10]Ali Baharev, Hermann Schichl, Arnold Neumaier, Tobias Achterberg:
An Exact Method for the Minimum Feedback Arc Set Problem. ACM J. Exp. Algorithmics 26: 1.4:1-1.4:28 (2021) - [j9]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): 443-490 (2021) - 2020
- [j8]Tobias Achterberg, Robert E. Bixby, Zonghao Gu, Edward Rothberg, Dieter Weninger:
Presolve Reductions in Mixed Integer Programming. INFORMS J. Comput. 32(2): 473-506 (2020)
2010 – 2019
- 2016
- [c9]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: 770-779 - 2014
- [c8]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: 1552-1561 - 2013
- [c7]Tobias Achterberg, Ashish Sabharwal, Horst Samulowitz:
Stronger Inference through Implied Literals from Conflicts and Knapsack Covers. CPAIOR 2013: 1-11 - 2011
- [j7]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): 103-163 (2011) - [c6]Tobias Achterberg, Timo Berthold, Gregor Hendel:
Rounding and Propagation Heuristics for Mixed Integer Programming. OR 2011: 71-76 - [e1]Tobias Achterberg, J. Christopher Beck:
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - 8th International Conference, CPAIOR 2011, Berlin, Germany, May 23-27, 2011. Proceedings. Lecture Notes in Computer Science 6697, Springer 2011, ISBN 978-3-642-21310-6 [contents] - 2010
- [j6]Tobias Achterberg, Christian Raack:
The Mcf-separator: detecting and exploiting multi-commodity flow structures in MIPs. Math. Program. Comput. 2(2): 125-165 (2010) - [c5]Yuji Shinano, Tobias Achterberg, Timo Berthold, Stefan Heinz, Thorsten Koch:
ParaSCIP: A Parallel Extension of SCIP. CHPC 2010: 135-148
2000 – 2009
- 2009
- [j5]Tobias Achterberg:
SCIP: solving constraint integer programs. Math. Program. Comput. 1(1): 1-41 (2009) - [c4]Tobias Achterberg, Timo Berthold:
Hybrid Branching. CPAIOR 2009: 309-311 - 2008
- [c3]Tobias Achterberg, Timo Berthold, Thorsten Koch, Kati Wolter:
Constraint Integer Programming: A New Approach to Integrate CP and MIP. CPAIOR 2008: 6-20 - [c2]Tobias Achterberg, Stefan Heinz, Thorsten Koch:
Counting Solutions of Integer Programs Using Unrestricted Subtree Detection. CPAIOR 2008: 278-282 - [c1]Yuji Shinano, Tobias Achterberg, Tetsuya Fujie:
A Dynamic Load Balancing Mechanism for New ParaLEX. ICPADS 2008: 455-462 - 2007
- [b1]Tobias Achterberg:
Constraint integer programming. Berlin Institute of Technology, Verlag Dr. Hut 2007, ISBN 978-3-89963-892-9, pp. 1-412 - [j4]Tobias Achterberg:
Conflict analysis in mixed integer programming. Discret. Optim. 4(1): 4-20 (2007) - [j3]Tobias Achterberg, Timo Berthold:
Improving the feasibility pump. Discret. Optim. 4(1): 77-86 (2007) - 2006
- [j2]Tobias Achterberg, Thorsten Koch, Alexander Martin:
MIPLIB 2003. Oper. Res. Lett. 34(4): 361-372 (2006) - 2005
- [j1]Tobias Achterberg, Thorsten Koch, Alexander Martin:
Branching rules revisited. Oper. Res. Lett. 33(1): 42-54 (2005)
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-04-25 05:48 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:
