A Partition-Based Heuristic for the Steiner Tree Problem in Large Graphs. - Markus Leitner; Ivana Ljubic; Martin Luipersbeck; Max Resch (Hybrid Metaheuristics, 2014)

Optimal Upgrading Schemes for Effective Shortest Paths in Networks. - Eduardo Álvarez-Miranda; Martin Luipersbeck; Markus Sinnl (CPAIOR, 2016)

A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death. - Eduardo Álvarez-Miranda; Hesso Farhan; Martin Luipersbeck; Markus Sinnl (Ann. Oper. Res., 2017)

A Benders decomposition based framework for solving cable trench problems. - Hatice Calik; Markus Leitner; Martin Luipersbeck (Comput. Oper. Res., 2017)

Solving minimum-cost shared arborescence problems. - Eduardo Álvarez-Miranda; Ivana Ljubic; Martin Luipersbeck; Markus Sinnl (Eur. J. Oper. Res., 2017)

Thinning out Steiner trees: a node-based model for uniform edge costs. - Matteo Fischetti; Markus Leitner; Ivana Ljubic; Martin Luipersbeck; Michele Monaci; Max Resch; Domenico Salvagnin; Markus Sinnl (Math. Program. Comput., 2017)

Decomposition methods for the two-stage stochastic Steiner tree problem. - Markus Leitner; Ivana Ljubic; Martin Luipersbeck; Markus Sinnl (Comput. Optim. Appl., 2018)

Gotta (efficiently) catch them all: Pokémon GO meets Orienteering Problems. - Eduardo Álvarez-Miranda; Martin Luipersbeck; Markus Sinnl (Eur. J. Oper. Res., 2018)

A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems. - Markus Leitner; Ivana Ljubic; Martin Luipersbeck; Markus Sinnl (INFORMS J. Comput., 2018)

An exact solution framework for the minimum cost dominating tree problem. - Eduardo Álvarez-Miranda; Martin Luipersbeck; Markus Sinnl (Optim. Lett., 2018)