Bernd Zey

Math. Program., 2021

Stronger MIP formulations for the Steiner forest problem.

[BibT_eX]

[DOI]

Math. Program., 2021

2018

An Exact Algorithm for the Steiner Forest Problem.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Solving two-stage stochastic network design problems to optimality

[BibT_eX]

[DOI]

PhD thesis, 2017

Stochastic survivable network design problems: Theory and practice.

[BibT_eX]

[DOI]

Ivana Ljubic

Eur. J. Oper. Res., 2017

MIP Formulations for the Steiner Forest Problem.

[BibT_eX]

[DOI]

CoRR, 2017

2016

ILP formulations for the two-stage stochastic Steiner tree problem.

[BibT_eX]

[DOI]

CoRR, 2016

2013

Stochastic Survivable Network Design Problems.

[BibT_eX]

[DOI]

Ivana Ljubic

Electron. Notes Discret. Math., 2013

2012

Improved Steiner tree algorithms for bounded treewidth.

[BibT_eX]

[DOI]

Markus Chimani

J. Discrete Algorithms, 2012

Parameterized Algorithms for Stochastic Steiner Tree Problems.

[BibT_eX]

[DOI]

Denis Kurz

Proceedings of the Mathematical and Engineering Methods in Computer Science, 2012

2010

Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009

Planar Biconnectivity Augmentation with Fixed Embedding.

[BibT_eX]

[DOI]

Carsten Gutwenger

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

On the Hardness and Approximability of Planar Biconnectivity Augmentation.

[BibT_eX]

[DOI]

Carsten Gutwenger