The Online Target Date Assignment Problem. - Stefan Heinz 001; Sven Oliver Krumke; Nicole Megow; Jörg Rambau; Andreas Tuchscherer; Tjark Vredeveld (WAOA, 2005)

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

Using Model Counting to Find Optimal Distinguishing Tests. - Stefan Heinz 001; Martin Sachenbacher (CPAIOR, 2009)

Nonlinear Pseudo-Boolean Optimization: Relaxation or Propagation?. - Timo Berthold; Stefan Heinz 001; Marc E. Pfetsch (SAT, 2009)

Competitive Online Multicommodity Routing. - Tobias Harks; Stefan Heinz 001; Marc E. Pfetsch (Theory Comput. Syst., 2009)

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

A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling. - Timo Berthold; Stefan Heinz 001; Marco E. Lübbecke; Rolf H. Möhring; Jens Schulz (CPAIOR, 2010)

An Approximative Criterion for the Potential of Energetic Reasoning. - Timo Berthold; Stefan Heinz 001; Jens Schulz (TAPAS, 2011)

Explanations for the Cumulative Constraint: An Experimental Study. - Stefan Heinz 001; Jens Schulz (SEA, 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)

Reconsidering Mixed Integer Programming and MIP-Based Hybrids for Scheduling. - Stefan Heinz 001; J. Christopher Beck (CPAIOR, 2012)

Solving steel mill slab design problems. - Stefan Heinz 001; Thomas Schlechte; Rüdiger Stephan; Michael Winkler (Constraints An Int. J., 2012)

Recent Improvements Using Constraint Integer Programming for Resource Allocation and Scheduling. - Stefan Heinz 001; Wen-Yang Ku; J. Christopher Beck (CPAIOR, 2013)

Using dual presolving reductions to reformulate cumulative constraints. - Stefan Heinz 001; Jens Schulz; J. Christopher Beck (Constraints An Int. J., 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)

Computational bounds for elevator control policies by large scale linear programming. - Stefan Heinz 001; Jörg Rambau; Andreas Tuchscherer (Math. Methods Oper. Res., 2014)

A First Implementation of ParaXpress: Combining Internal and External Parallelization to Solve MIPs on Supercomputers. - Yuji Shinano; Timo Berthold; Stefan Heinz 001 (ICMS, 2016)

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)

Experiments with Conflict Analysis in Mixed Integer Programming. - Jakob Witzig; Timo Berthold; Stefan Heinz 001 (CPAIOR, 2017)

FiberSCIP - A Shared Memory Parallelization of SCIP. - Yuji Shinano; Stefan Heinz 001; Stefan Vigerske; Michael Winkler (INFORMS J. Comput., 2018)

Parallelization of the FICO Xpress-Optimizer. - Timo Berthold; James Farmer; Stefan Heinz 001; Michael Perregaard (Optim. Methods Softw., 2018)

ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers. - Yuji Shinano; Timo Berthold; Stefan Heinz 001 (Optim. Methods Softw., 2018)

Presolving techniques and linear relaxations for cumulative scheduling. - Stefan Heinz 001 (2018)

A Status Report on Conflict Analysis in Mixed Integer Nonlinear Programming. - Jakob Witzig; Timo Berthold; Stefan Heinz 001 (CPAIOR, 2019)

Structure-driven fix-and-propagate heuristics for mixed integer programming. - Gerald Gamrath; Timo Berthold; Stefan Heinz 001; Michael Winkler (Math. Program. Comput., 2019)

Computational aspects of infeasibility analysis in mixed integer programming. - Jakob Witzig; Timo Berthold; Stefan Heinz 001 (Math. Program. Comput., 2021)