Branching rules revisited. - Tobias Achterberg; Thorsten Koch; Alexander Martin 001 (Oper. Res. Lett., 2005)

MIPLIB 2003. - Tobias Achterberg; Thorsten Koch; Alexander Martin 001 (Oper. Res. Lett., 2006)

Conflict analysis in mixed integer programming. - Tobias Achterberg (Discret. Optim., 2007)

Improving the feasibility pump. - Tobias Achterberg; Timo Berthold (Discret. Optim., 2007)

Constraint integer programming. - Tobias Achterberg (Verlag Dr. Hut, 2007)

Constraint Integer Programming: A New Approach to Integrate CP and MIP. - Tobias Achterberg; Timo Berthold; Thorsten Koch; Kati Wolter (CPAIOR, 2008)

Counting Solutions of Integer Programs Using Unrestricted Subtree Detection. - Tobias Achterberg; Stefan Heinz 001; Thorsten Koch (CPAIOR, 2008)

A Dynamic Load Balancing Mechanism for New ParaLEX. - Yuji Shinano; Tobias Achterberg; Tetsuya Fujie (ICPADS, 2008)

Hybrid Branching. - Tobias Achterberg; Timo Berthold (CPAIOR, 2009)

SCIP: solving constraint integer programs. - Tobias Achterberg (Math. Program. Comput., 2009)

ParaSCIP: A Parallel Extension of SCIP. - Yuji Shinano; Tobias Achterberg; Timo Berthold; Stefan Heinz 001; Thorsten Koch (CHPC, 2010)

The Mcf-separator: detecting and exploiting multi-commodity flow structures in MIPs. - Tobias Achterberg; Christian Raack (Math. Program. Comput., 2010)

Rounding and Propagation Heuristics for Mixed Integer Programming. - Tobias Achterberg; Timo Berthold; Gregor Hendel (OR, 2011)

MIPLIB 2010. - Thorsten Koch; Tobias Achterberg; Erling Andersen; Oliver Bastert; Timo Berthold; Robert E. Bixby; Emilie Danna; Gerald Gamrath; Ambros M. Gleixner; Stefan Heinz 001; Andrea Lodi 001; Hans D. Mittelmann; et al. (Math. Program. Comput., 2011)

Stronger Inference through Implied Literals from Conflicts and Knapsack Covers. - Tobias Achterberg; Ashish Sabharwal; Horst Samulowitz (CPAIOR, 2013)

Solving Hard MIPLIB2003 Problems with ParaSCIP on Supercomputers: An Update. - Yuji Shinano; Tobias Achterberg; Timo Berthold; Stefan Heinz 001; Thorsten Koch; Michael Winkler (IPDPS Workshops, 2014)

Solving Open MIP Instances with ParaSCIP on Supercomputers Using up to 80, 000 Cores. - Yuji Shinano; Tobias Achterberg; Timo Berthold; Stefan Heinz 001; Thorsten Koch; Michael Winkler (IPDPS, 2016)

Presolve Reductions in Mixed Integer Programming. - Tobias Achterberg; Robert E. Bixby; Zonghao Gu; Edward Rothberg; Dieter Weninger (INFORMS J. Comput., 2020)

An Exact Method for the Minimum Feedback Arc Set Problem. - Ali Baharev; Hermann Schichl; Arnold Neumaier; Tobias Achterberg (ACM J. Exp. Algorithmics, 2021)

MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. - Ambros M. Gleixner; Gregor Hendel; Gerald Gamrath; Tobias Achterberg; Michael Bastubbe; Timo Berthold; Philipp M. Christophel; Kati Jarck; Thorsten Koch; Jeff T. Linderoth; Marco E. Lübbecke; Hans D. Mittelmann; et al. (Math. Program. Comput., 2021)

Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Products. - Ksenia Bestuzheva; Ambros M. Gleixner; Tobias Achterberg (IPCO, 2023)

Efficient separation of RLT cuts for implicit and explicit bilinear terms. - Ksenia Bestuzheva; Ambros M. Gleixner; Tobias Achterberg (Math. Program., 2025)