Martin Luipersbeck

According to our database1, Martin Luipersbeck authored at least 10 papers between 2014 and 2018.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
An exact solution framework for the minimum cost dominating tree problem.
Optim. Lett., 2018

A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems.
INFORMS J. Comput., 2018

Gotta (efficiently) catch them all: Pokémon GO meets Orienteering Problems.
Eur. J. Oper. Res., 2018

Decomposition methods for the two-stage stochastic Steiner tree problem.
Comput. Optim. Appl., 2018

2017
Thinning out Steiner trees: a node-based model for uniform edge costs.
Math. Program. Comput., 2017

Solving minimum-cost shared arborescence problems.
Eur. J. Oper. Res., 2017

A Benders decomposition based framework for solving cable trench problems.
Comput. Oper. Res., 2017

A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death.
Ann. Oper. Res., 2017

2016
Optimal Upgrading Schemes for Effective Shortest Paths in Networks.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2016

2014
A Partition-Based Heuristic for the Steiner Tree Problem in Large Graphs.
Proceedings of the Hybrid Metaheuristics - 9th International Workshop, HM 2014, 2014


  Loading...