Martin Luipersbeck

Thinning out Steiner trees: a node-based model for uniform edge costs

Matteo Fischetti, Michele Monaci, Markus Leitner, 2017, Math. Program. Comput..

A Partition-Based Heuristic for the Steiner Tree Problem in Large Graphs

Markus Leitner, Ivana Ljubic, Martin Luipersbeck, 2014, Hybrid Metaheuristics.

A Benders decomposition based framework for solving cable trench problems

Markus Leitner, Martin Luipersbeck, Hatice Calik, 2017, Comput. Oper. Res..

Solving minimum-cost shared arborescence problems

Ivana Ljubic, Markus Sinnl, Eduardo Álvarez-Miranda, 2017, Eur. J. Oper. Res..

Optimal Upgrading Schemes for Effective Shortest Paths in Networks

Markus Sinnl, Eduardo Álvarez-Miranda, Martin Luipersbeck, 2016, CPAIOR.

A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems

Markus Leitner, Ivana Ljubic, Markus Sinnl, 2018, INFORMS J. Comput..

Gotta (efficiently) catch them all: Pokémon GO meets Orienteering Problems

Markus Sinnl, Eduardo Álvarez-Miranda, Martin Luipersbeck, 2018, Eur. J. Oper. Res..

Decomposition methods for the two-stage stochastic Steiner tree problem

Markus Leitner, I. Ljubić, Markus Sinnl, 2017, Computational Optimization and Applications.

A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death

Markus Sinnl, Eduardo Álvarez-Miranda, Martin Luipersbeck, 2016, Annals of Operations Research.