Tobias Achterberg

23 papers A 1B 7Journal 11Unranked 3

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Efficient separation of RLT cuts for implicit and explicit bilinear terms. Math. Program. Ksenia Bestuzheva, Ambros M. Gleixner, Tobias Achterberg
2023	B	`conf`	Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Products. IPCO Ksenia Bestuzheva, Ambros M. Gleixner, Tobias Achterberg
2021	J	`jnl`	An Exact Method for the Minimum Feedback Arc Set Problem. ACM J. Exp. Algorithmics Ali Baharev, Hermann Schichl, Arnold Neumaier, Tobias Achterberg
2021	J	`jnl`	MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Math. Program. Comput. 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, Derya B. Özyurt, Ted K. Ralphs, Domenico Salvagnin, Yuji Shinano
2020	J	`jnl`	Presolve Reductions in Mixed Integer Programming. INFORMS J. Comput. Tobias Achterberg, Robert E. Bixby, Zonghao Gu, Edward Rothberg, Dieter Weninger
2016	A	`conf`	Solving Open MIP Instances with ParaSCIP on Supercomputers Using up to 80, 000 Cores. IPDPS Yuji Shinano, Tobias Achterberg, Timo Berthold, Stefan Heinz, Thorsten Koch, Michael Winkler
2014	—	`conf`	Solving Hard MIPLIB2003 Problems with ParaSCIP on Supercomputers: An Update. IPDPS Workshops Yuji Shinano, Tobias Achterberg, Timo Berthold, Stefan Heinz, Thorsten Koch, Michael Winkler
2013	B	`conf`	Stronger Inference through Implied Literals from Conflicts and Knapsack Covers. CPAIOR Tobias Achterberg, Ashish Sabharwal, Horst Samulowitz
2011	B	`ed.`	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 CPAIOR Tobias Achterberg, J. Christopher Beck
2011	J	`jnl`	MIPLIB 2010. Math. Program. Comput. 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
2011	—	`conf`	Rounding and Propagation Heuristics for Mixed Integer Programming. OR Tobias Achterberg, Timo Berthold, Gregor Hendel
2010	—	`conf`	ParaSCIP: A Parallel Extension of SCIP. CHPC Yuji Shinano, Tobias Achterberg, Timo Berthold, Stefan Heinz, Thorsten Koch
2010	J	`jnl`	The Mcf-separator: detecting and exploiting multi-commodity flow structures in MIPs. Math. Program. Comput. Tobias Achterberg, Christian Raack
2009	B	`conf`	Hybrid Branching. CPAIOR Tobias Achterberg, Timo Berthold
2009	J	`jnl`	SCIP: solving constraint integer programs. Math. Program. Comput. Tobias Achterberg
2008	B	`conf`	A Dynamic Load Balancing Mechanism for New ParaLEX. ICPADS Yuji Shinano, Tobias Achterberg, Tetsuya Fujie
2008	B	`conf`	Constraint Integer Programming: A New Approach to Integrate CP and MIP. CPAIOR Tobias Achterberg, Timo Berthold, Thorsten Koch, Kati Wolter
2008	B	`conf`	Counting Solutions of Integer Programs Using Unrestricted Subtree Detection. CPAIOR Tobias Achterberg, Stefan Heinz, Thorsten Koch
2007	J	`jnl`	Conflict analysis in mixed integer programming. Discret. Optim. Tobias Achterberg
2007	—	`—`	Constraint integer programming. Tobias Achterberg
2007	J	`jnl`	Improving the feasibility pump. Discret. Optim. Tobias Achterberg, Timo Berthold
2006	J	`jnl`	MIPLIB 2003. Oper. Res. Lett. Tobias Achterberg, Thorsten Koch, Alexander Martin
2005	J	`jnl`	Branching rules revisited. Oper. Res. Lett. Tobias Achterberg, Thorsten Koch, Alexander Martin