Markus Leitner

According to our database1, Markus Leitner authored at least 39 papers between 2007 and 2021.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2021
Large-scale influence maximization via maximal covering location.
Eur. J. Oper. Res., 2021

2020
Location of Charging Stations in Electric Car Sharing Systems.
Transp. Sci., 2020

Corrigendum to "Extended Formulations and Branch-and-Cut Algorithms for the Black-and-White Traveling Salesman Problem" [European Journal of Operational Research, 262(3) 2017, 908-928].
Eur. J. Oper. Res., 2020

A polyhedral study of the diameter constrained minimum spanning tree problem.
Discret. Appl. Math., 2020

2019
Exact Approaches for Network Design Problems with Relays.
INFORMS J. Comput., 2019

Layered graph approaches for combinatorial optimization problems.
Comput. Oper. Res., 2019

2018
Least cost influence propagation in (social) networks.
Math. Program., 2018

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

The connected facility location polytope.
Discret. Appl. Math., 2018

Branch-and-cut methods for the Network Design Problem with Vulnerability Constraints.
Comput. 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

An algorithmic framework for the exact solution of tree-star problems.
Eur. J. Oper. Res., 2017

Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem.
Eur. J. Oper. Res., 2017

Design of survivable networks with vulnerability constraints.
Eur. J. Oper. Res., 2017

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

2016
ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design.
Comput. Oper. Res., 2016

Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem.
Comput. Oper. Res., 2016

Integer programming models and branch-and-cut approaches to generalized {0, 1, 2}-survivable network design problems.
Comput. Optim. Appl., 2016

2015
The two-level diameter constrained spanning tree problem.
Math. Program., 2015

A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem.
INFORMS J. Comput., 2015

2014
Hop constrained Steiner trees with multiple root nodes.
Eur. J. Oper. Res., 2014

On the Asymmetric Connected Facility Location Polytope.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

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

2013
Stabilizing branch-and-price for constrained tree problems.
Networks, 2013

On the Two-Architecture Connected Facility Location Problem.
Electron. Notes Discret. Math., 2013

Solving the bi-objective prize-collecting Steiner tree problem with the ϵ-constraint method.
Electron. Notes Discret. Math., 2013

2012
Variable Neighborhood Search for Solving the Balanced Location Problem.
Electron. Notes Discret. Math., 2012

On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011
Branch-and-Cut-and-Price for Capacitated Connected Facility Location.
J. Math. Model. Algorithms, 2011

Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem.
Proceedings of the Network Optimization - 5th International Conference, 2011

Variable Neighborhood and Greedy Randomized Adaptive Search for Capacitated Connected Facility Location.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2011, 2011

2010
The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search.
Networks, 2010

Strong Lower Bounds for a Survivable Network Design Problem.
Electron. Notes Discret. Math., 2010

2008
Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem.
J. Heuristics, 2008

Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem.
Proceedings of the 2008 International Symposium on Applications and the Internet, 2008

Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks.
Proceedings of the Hybrid Metaheuristics, 5th International Workshop, 2008

2007
Fault Management based on peer-to-peer paradigms; A case study report from the CELTIC project Madeira.
Proceedings of the Integrated Network Management, 2007

Self-forming Network Management Topologies in the Madeira Management System.
Proceedings of the Inter-Domain Management, 2007


  Loading...