Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision | Previous revision | ||
staff:zey [2018-08-27 13:22] |
staff:zey [2019-02-18 11:30] |
||
---|---|---|---|
Line 18: | Line 18: | ||
* Algorithm Engineering | * Algorithm Engineering | ||
* Combinatorial Optimization | * Combinatorial Optimization | ||
- | * Graph Algorithms, Network Design Problems (in particular Steiner tree problems) | + | * Graph Algorithms, Network Design Problems (in particular Steiner tree and Steiner forest problems) |
- | * Integer Programming, Branch&Cut, Benders Decomposition | + | * Stochastic (Integer) Programming, (2-Stage) Branch&Cut, (Integer) L-Shaped Method |
- | * Stochastic (Integer) Programming, 2-Stage Branch&Cut, (Integer) L-Shaped Method | + | |
* **Projects** | * **Projects** | ||
Line 34: | Line 33: | ||
=== Refereed Conference Proceedings === | === Refereed Conference Proceedings === | ||
- | * **[[http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=9533|An exact algorithm for the Steiner forest problem]]**\\ //Daniel Schmidt, Bernd Zey, and Francois Margot// \\ European Symposium on Algorithms (ESA), Leibniz International Proceedings in Informatics (LIPIcs), pp. 70:1-70:14, 2018 \\ **awarded ESA track B best paper** | + | * **[[http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=9533|An exact algorithm for the Steiner forest problem]]**\\ //Daniel Schmidt, Bernd Zey, and Francois Margot// \\ European Symposium on Algorithms (ESA), Leibniz International Proceedings in Informatics (LIPIcs), pp. 70:1-70:14, 2018, **awarded ESA track B best paper** |
* **[[http://www.sciencedirect.com/science/article/pii/S1571065313001029|Stochastic Survivable Network Design Problems]]**\\ //Ivana Ljubic, Petra Mutzel, and Bernd Zey// \\ International Network Optimization Conference (INOC) \\ Electronic Notes in Discrete Mathematics (ENDM), 2013, pp.245-252 | * **[[http://www.sciencedirect.com/science/article/pii/S1571065313001029|Stochastic Survivable Network Design Problems]]**\\ //Ivana Ljubic, Petra Mutzel, and Bernd Zey// \\ International Network Optimization Conference (INOC) \\ Electronic Notes in Discrete Mathematics (ENDM), 2013, pp.245-252 | ||
Line 51: | Line 50: | ||
=== Journal Articles === | === Journal Articles === | ||
+ | |||
+ | * ** Stronger MIP formulations for the Steiner forest problem**\\ //Daniel Schmidt, Bernd Zey, Francois Margot//, //submitted// | ||
* **[[http://dx.doi.org/10.1016/j.ejor.2016.06.048|Stochastic Survivable Network Design Problems: Theory and practice]]**\\ //Ivana Ljubic, Petra Mutzel, and Bernd Zey// \\ European Journal of Operational Research (EJOR), volume 256, issue 2, 2017, pp. 333-348 | * **[[http://dx.doi.org/10.1016/j.ejor.2016.06.048|Stochastic Survivable Network Design Problems: Theory and practice]]**\\ //Ivana Ljubic, Petra Mutzel, and Bernd Zey// \\ European Journal of Operational Research (EJOR), volume 256, issue 2, 2017, pp. 333-348 | ||
Line 75: | Line 76: | ||
- | + | * Wintersemester 2018/2019 | |
+ | * [[https://ls11-www.cs.tu-dortmund.de/teaching/ep1819sopra | Programmierpraktikum zur Vorlesung "Einführung in die Programmierung"]] | ||
* Sommersemester 2018 | * Sommersemester 2018 | ||
* [[https://ls11-www.cs.tu-dortmund.de/teaching/dap2_ss18_praktikum | DAP2 (Praktikum)]] | * [[https://ls11-www.cs.tu-dortmund.de/teaching/dap2_ss18_praktikum | DAP2 (Praktikum)]] |