me

Research assistant at ZIB and TU Berlin working on multi-criteria optimisation.
Main developer of PolySCIP, a solver for multi-criteria linear and multi-criteria integer programs.

Languages: German, English, Italian, Hungarian (rusty), C++, Python

Contact at ZIB

Zuse Institute Berlin
Department of Mathematical Optimization
Takustraße 7
14195 Berlin (Germany)
room: 3352
phone: +49 30 84185 223
e-mail: schenker@zib.de

Contact at TU Berlin

TU Berlin, Institute of Mathematics
Combinatorial Optimization & Graph Algorithms group
Straße des 17. Juni 136
10623 Berlin (Germany)
room: MA 524
phone: +49 30 31427 448
e-mail: schenker@math.tu-berlin.de

Research Interests

Multicriteria Optimisation multicriteria optimisation

I am the main developer of PolySCIP, a solver for multi-criteria linear and multi-criteria integer programs. PolySCIP is part of the SCIP Optimisation Suite. For more information, please visit polyscip.zib.de.
In order to visualise the objective space of bi-criteria and tri-criteria integer programs I have developed PolyNondom.
Andreas Löhne and I maintain MOPLIB, a multi-objective problem library which aims at offering problem instances for available multi-objective solvers.

Vertex Enumeration vertex enumeration

Vertex enumeration plays an important part in the solving process of PolySCIP. In particular, PolySCIP uses an implementation of the double description method for the initialisation phase of the weight space polytope.
Currently, I also maintain the PORTA webpage.

Multiple Sequence Alignment sequence alignment

There is a nice paper on a branch-and-cut algorithm for multiple sequence alignment. During a research stay at the University of Coimbra I implemented the separation algorithms for the valid inequalities given in this paper. Luís Paquete and I used the described algorithmic approach to compute non-dominated outcomes for bi-criteria multiple sequence alignment problems. The source code is freely available . There is also a short technical report. The implementation was done in C++-98 and uses the LEMON graph library. The source code is, unfortunately, not well documented. However, if you have understood how the separation algorithms work from the mathematical point of view, then you should be able to understand the implementation and be able to reuse the code. I am happy if you do so.


Academic CV

02/2012 - present Research assistant at ZIB and TU Berlin
09/2011 - 01/2012 Post-graduate student at Research Training Group Methods for Discrete Structures
04/2011 - 08/2011 Research assistant at University of Coimbra (Portugal)
10/2007 - 11/2010 Main studies and Diplom in mathematics at TU Berlin
Diplom thesis: Approximating Pareto Sets in Multi-Criteria Optimization
08/2006 - 10/2010 Scholarship holder of the German Academic Scholarship Foundation
08/2006 - 08/2007 Exchange student at Eötvös-Loránd-University in Budapest (Hungary) with scholarship Metropolen in Osteuropa
02/2006 - 07/2006 Erasmus exchange at Babeş-Bolyai-University in Cluj-Napoca (Romania)
10/2005 - 01/2006 Internship at Intershop Communications AG in Jena
10/2003 - 09/2005 Vordiplom in mathematics at Friedrich-Schiller-University in Jena

Publications

2017

  • Optimisation Methods in Sustainable Manufacturing
    S. Schenker, I. Vierhaus, R. Borndörfer, A. Fügenschuh, M. Skutella
    Sustainable Manufacturing: Challenges, Solutions and Implementation Perspectives,
    R. Stark, G. Seliger, J. Bonvoisin (Eds.), pp. 239-253, Springer International Publishing, ISBN:978-3-319-48514-0, BibTex
  • The SCIP Optimization Suite 4.0
    S.J. Maher, T. Fischer, T. Gally, G. Gamrath, A. Gleixner, R.L. Gottwald, G. Hendel, T. Koch, M.E. Lübbecke, M. Miltenberger, B. Müller, M.E. Pfetsch, C. Puchert, D. Rehfeldt, S. Schenker, R. Schwarz, F. Serrano, Y. Shinano, D. Weninger, J.T. Witt, J. Witzig
    ZIB-Report 17-12, BibTex

2016

2015

2014

2012