Markus Leitner

According to our database, Markus Leitner authored at least 48 papers between 2007 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

An exact method for binary fortification games.

Markus Leitner, Ivana Ljubic, Michele Monaci, Markus Sinnl, Kübra Taninmis

Eur. J. Oper. Res., June, 2023

Multi-Depot Routing with Split Deliveries: Models and a Branch-and-Cut Algorithm.

Luís Gouveia, Markus Leitner, Mario Ruthmair

Transp. Sci., March, 2023

2022

Arc Routing with Electric Vehicles: Dynamic Charging and Speed-Dependent Energy Consumption.

Elena Fernández, Markus Leitner, Ivana Ljubic, Mario Ruthmair

Transp. Sci., 2022

Grasping the Inconspicuous.

Hrishikesh Gupta, Stefan Thalhammer, Markus Leitner, Markus Vincze

CoRR, 2022

2021

Preface: Special issue on network analytics and optimization.

Bernard Fortz, Luis Gouveia, Christina Büsing, Markus Leitner

Networks, 2021

Trust Your Data or Not - StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization.

Immanuel M. Bomze, Michael Kahr, Markus Leitner

Math. Oper. Res., 2021

Large-scale influence maximization via maximal covering location.

Evren Güney, Markus Leitner, Mario Ruthmair, Markus Sinnl

Eur. J. Oper. Res., 2021

An Exact Method for Fortification Games.

Markus Leitner, Ivana Ljubic, Michele Monaci, Markus Sinnl, Kübra Taninmis

CoRR, 2021

Object Learning for 6D Pose Estimation and Grasping from RGB-D Videos of In-hand Manipulation.

Timothy Patten, Kiru Park, Markus Leitner, Kevin Wolfram, Markus Vincze

Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 2021

PyraPose: Feature Pyramids for Fast and Accurate Object Pose Estimation under Domain Shift.

Stefan Thalhammer, Markus Leitner, Timothy Patten, Markus Vincze

Proceedings of the IEEE International Conference on Robotics and Automation, 2021

2020

Location of Charging Stations in Electric Car Sharing Systems.

Georg Brandstätter, Markus Leitner, Ivana Ljubic

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].

Luis Gouveia, Markus Leitner, Mario Ruthmair, Ruslan Sadykov

Eur. J. Oper. Res., 2020

A polyhedral study of the diameter constrained minimum spanning tree problem.

Luis Gouveia, Markus Leitner, Ivana Ljubic

Discret. Appl. Math., 2020

2019

Exact Approaches for Network Design Problems with Relays.

Markus Leitner, Ivana Ljubic, Martin Riedler, Mario Ruthmair

INFORMS J. Comput., 2019

Layered graph approaches for combinatorial optimization problems.

Luis Gouveia, Markus Leitner, Mario Ruthmair

Comput. Oper. Res., 2019

2018

Least cost influence propagation in (social) networks.

Matteo Fischetti, Michael Kahr, Markus Leitner, Michele Monaci, Mario Ruthmair

Math. Program., 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

The connected facility location polytope.

Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl

Discret. Appl. Math., 2018

Branch-and-cut methods for the Network Design Problem with Vulnerability Constraints.

Luís Gouveia, Martim Joyce-Moniz, Markus Leitner

Comput. Oper. Res., 2018

Decomposition methods for the two-stage stochastic Steiner tree problem.

Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl

Comput. Optim. Appl., 2018

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

An algorithmic framework for the exact solution of tree-star problems.

Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl

Eur. J. Oper. Res., 2017

Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem.

Luis Eduardo Neves Gouveia, Markus Leitner, Mario Ruthmair

Eur. J. Oper. Res., 2017

Design of survivable networks with vulnerability constraints.

Luis Gouveia, Markus Leitner

Eur. J. Oper. Res., 2017

A Benders decomposition based framework for solving cable trench problems.

Hatice Calik, Markus Leitner, Martin Luipersbeck

Comput. Oper. Res., 2017

2016

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

Markus Leitner, Ivana Ljubic, Markus Sinnl, Axel Werner

Comput. Oper. Res., 2016

Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem.

Markus Leitner

Comput. Oper. Res., 2016

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

Markus Leitner

Comput. Optim. Appl., 2016

2015

The two-level diameter constrained spanning tree problem.

Luis Eduardo Neves Gouveia, Markus Leitner, Ivana Ljubic

Math. Program., 2015

A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem.

Markus Leitner, Ivana Ljubic, Markus Sinnl

INFORMS J. Comput., 2015

2014

Hop constrained Steiner trees with multiple root nodes.

Luis Eduardo Neves Gouveia, Markus Leitner, Ivana Ljubic

Eur. J. Oper. Res., 2014

On the Asymmetric Connected Facility Location Polytope.

Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl

Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

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

Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Max Resch

Proceedings of the Hybrid Metaheuristics - 9th International Workshop, HM 2014, 2014

2013

Stabilizing branch-and-price for constrained tree problems.

Markus Leitner, Mario Ruthmair, Günther R. Raidl

Networks, 2013

On the Two-Architecture Connected Facility Location Problem.

Markus Leitner, Ivana Ljubic, Markus Sinnl, Axel Werner

Electron. Notes Discret. Math., 2013

Solving the bi-objective prize-collecting Steiner tree problem with the ϵ-constraint method.

Markus Leitner, Ivana Ljubic, Markus Sinnl

Electron. Notes Discret. Math., 2013

2012

Variable Neighborhood Search for Solving the Balanced Location Problem.

Jozef Kratica, Markus Leitner, Ivana Ljubic

Electron. Notes Discret. Math., 2012

On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes.

Luis Eduardo Neves Gouveia, Markus Leitner, Ivana Ljubic

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011

Branch-and-Cut-and-Price for Capacitated Connected Facility Location.

Markus Leitner, Günther R. Raidl

J. Math. Model. Algorithms, 2011

Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem.

Markus Leitner, Mario Ruthmair, Günther R. Raidl

Proceedings of the Network Optimization - 5th International Conference, 2011

Variable Neighborhood and Greedy Randomized Adaptive Search for Capacitated Connected Facility Location.

Markus Leitner, Günther R. Raidl

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.

Bin Hu, Markus Leitner, Günther R. Raidl

Networks, 2010

Strong Lower Bounds for a Survivable Network Design Problem.

Markus Leitner, Günther R. Raidl

Electron. Notes Discret. Math., 2010

2008

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

Bin Hu, Markus Leitner, Günther R. Raidl

J. Heuristics, 2008

Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem.

Markus Leitner, Günther R. Raidl

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.

Markus Leitner, Günther R. Raidl

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.

Markus Leitner, Philipp Leitner, Martin Zach, Sandra Collins, Claire Fahy

Proceedings of the Integrated Network Management, 2007

Self-forming Network Management Topologies in the Madeira Management System.

Liam Fallon, Daryl Parker, Martin Zach, Markus Leitner, Sandra Collins

Proceedings of the Inter-Domain Management, 2007