Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Previous revision | ||
|
staff:zey [2019-01-24 20:39] |
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 52: | Line 51: | ||
| === Journal Articles === | === Journal Articles === | ||
| - | * ** Stronger MIP formulations for the Steiner forest problem**\\ //Daniel Schmidt, Bernd Zey, Francois Margot// \\submitted, 2019 | + | * ** 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 | ||