Publications

Filter by type:
(2018). Adaptive Algorithmic Behavior for Solving Mixed Integer Programs Using Bandit Algorithms. ZIB-Report 18-36.

Preprint PDF Opus

(2018). The SCIP Optimization Suite 6.0. ZIB-Report 18-26.

PDF Opus

(2018). Feature-Based Algorithm Selection for Mixed Integer Programming. ZIB-Report 18-17.

Preprint PDF Code Opus

(2017). The SCIP Optimization Suite 5.0. ZIB-Report 17-61.

PDF Opus

(2017). From feasibility to improvement to proof: three phases of solving mixed-integer programs. In Optimization Methods and Software, 33 (3), pp. 499-517, 2017.

Preprint PDF DOI Opus

(2017). The SCIP Optimization Suite 4.0. ZIB-Report 17-12.

PDF Opus revised-version pdf

(2016). The SCIP Optimization Suite 3.2. ZIB-Report 15-60.

PDF Opus

(2015). Exploiting Solving Phases for Mixed-Integer Programs. In Operations Research Proceedings 2015, pp. 3-9, 2016.

Preprint DOI Opus

(2015). Enhancing MIP Branching Decisions by Using the Sample Variance of Pseudo Costs. In Integration of AI and OR Techniques in Constraint Programming, pp. 199-214, Vol.9075, Lecture Notes in Computer Science, 2015.

Preprint DOI Opus

(2014). Empirical Analysis of Solving Phases in Mixed Integer Programming. Masters thesis, Technische Universität Berlin, 2014.

PDF Opus

(2014). Shift-and-Propagate. In Journal of Heuristics, 21 (1), pp. 73-106, 2014.

Preprint DOI Opus

(2011). Rounding and Propagation Heuristics for Mixed Integer Programming. In Operations Research Proceedings 2011, pp. 71-76.

Preprint DOI Opus

(2011). New Rounding and Propagation Heuristics for Mixed Integer Programming. Bachelors thesis, Technische Universität Berlin, 2011.

PDF Opus