Martin Luipersbeck

Publication Activity (10 Years)

Years Active: 2014-2018
Publications (10 Years): 9

Top Topics

Related Problems

Decomposition Methods

Top Venues

Eur. J. Oper. Res.

Ann. Oper. Res.

Comput. Oper. Res.

Hybrid Metaheuristics

Publications

Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl
A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems. INFORMS J. Comput. 30 (2) (2018)
Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl
Decomposition methods for the two-stage stochastic Steiner tree problem. Comput. Optim. Appl. 69 (3) (2018)
Eduardo Álvarez-Miranda, Martin Luipersbeck, Markus Sinnl
An exact solution framework for the minimum cost dominating tree problem. Optim. Lett. 12 (7) (2018)
Eduardo Álvarez-Miranda, Martin Luipersbeck, Markus Sinnl
Gotta (efficiently) catch them all: Pokémon GO meets Orienteering Problems. Eur. J. Oper. Res. 265 (2) (2018)
Eduardo Álvarez-Miranda, Hesso Farhan, Martin Luipersbeck, Markus Sinnl
A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death. Ann. Oper. Res. 258 (1) (2017)
Matteo Fischetti, Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Michele Monaci, Max Resch, Domenico Salvagnin, Markus Sinnl
Thinning out Steiner trees: a node-based model for uniform edge costs. Math. Program. Comput. 9 (2) (2017)
Eduardo Álvarez-Miranda, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl
Solving minimum-cost shared arborescence problems. Eur. J. Oper. Res. 258 (3) (2017)
Hatice Calik, Markus Leitner, Martin Luipersbeck
A Benders decomposition based framework for solving cable trench problems. Comput. Oper. Res. 81 (2017)
Eduardo Álvarez-Miranda, Martin Luipersbeck, Markus Sinnl
Optimal Upgrading Schemes for Effective Shortest Paths in Networks. CPAIOR (2016)
Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Max Resch
A Partition-Based Heuristic for the Steiner Tree Problem in Large Graphs. Hybrid Metaheuristics (2014)