Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
staff:zey [2018-10-02 10:13]
Bernd Zey
staff:zey [2019-02-18 11:30] (current)
Bernd Zey
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-StageBranch&​Cut,​ (Integer) L-Shaped Method
-    * Stochastic (Integer) Programming,​ 2-Stage Branch&​Cut,​ (Integer) L-Shaped Method+
  
   * **Projects**   * **Projects**
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
 
Last modified: 2018-10-02 10:13 by Bernd Zey
DokuWikiRSS-Feed