Markus Leitner

发表

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

Markus Leitner, 2016, Comput. Optim. Appl..

Strong Lower Bounds for a Survivable Network Design Problem

Markus Leitner, Günther R. Raidl, 2010, Electron. Notes Discret. Math..

A Lagrangian Decomposition Based Heuristic for Capacitated Connected Facility Location

Markus Leitner, Günther R. Raidl, 2009 .

The two-level diameter constrained spanning tree problem

Markus Leitner, Luís Gouveia, Ivana Ljubic, 2015, Math. Program..

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

Markus Leitner, Günther R. Raidl, G. Raidl, 2011, EUROCAST.

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

Markus Leitner, Luís Gouveia, Martim Joyce-Moniz, 2018, Comput. Oper. Res..

Accelerating Column Generation for a Survivable Network Design Problem

Markus Leitner, Günther R. Raidl, Ulrich Pferschy, 2009 .

A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems

Markus Leitner, Ivana Ljubic, Markus Sinnl, 2018, INFORMS J. Comput..

Combining Lagrangian Decomposition with Very Large Scale Neighborhood Search for Capacitated Connected Facility Location

Markus Leitner, Günther R. Raidl, 2009 .

The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search

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

Design of survivable networks with vulnerability constraints

Markus Leitner, Luís Gouveia, 2017, Eur. J. Oper. Res..

On the Two-Architecture Connected Facility Location Problem

Markus Leitner, Ivana Ljubic, Markus Sinnl, 2013, Electron. Notes Discret. Math..

Stabilizing branch-and-price for constrained tree problems

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

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

Timothy Patten, Markus Vincze, Markus Leitner, 2020, 2021 IEEE International Conference on Robotics and Automation (ICRA).

A Benders decomposition based framework for solving cable trench problems

Markus Leitner, Martin Luipersbeck, Hatice Calik, 2017, Comput. Oper. Res..

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]

Markus Leitner, Ruslan Sadykov, Mario Ruthmair, 2020, Eur. J. Oper. Res..

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

Markus Leitner, Luís Gouveia, Mario Ruthmair, 2017, Eur. J. Oper. Res..

On the Asymmetric Connected Facility Location Polytope

Juan José Salazar González, Markus Leitner, Ivana Ljubic, 2014, ISCO.

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

Markus Leitner, Günther R. Raidl, 2008, 2008 International Symposium on Applications and the Internet.

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

Markus Leitner, Ivana Ljubic, Markus Sinnl, 2013, Electron. Notes Discret. Math..

Exact Approaches for Network Design Problems with Relays

Markus Leitner, Ivana Ljubic, Martin Riedler, 2019, INFORMS J. Comput..

Decomposition methods for the two-stage stochastic Steiner tree problem

Markus Leitner, Ivana Ljubic, Markus Sinnl, 2018, Comput. Optim. Appl..

Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks

Markus Leitner, Günther R. Raidl, G. Raidl, 2008, Hybrid Metaheuristics.

Thinning out Steiner trees: a node-based model for uniform edge costs

Matteo Fischetti, Michele Monaci, Markus Leitner, 2017, Math. Program. Comput..

Fault Management based on peer-to-peer paradigms; A case study report from the CELTIC project Madeira

Markus Leitner, Philipp Leitner, Sandra Collins, 2007, 2007 10th IFIP/IEEE International Symposium on Integrated Network Management.

Exact approaches for the directed network design problem with relays

Markus Leitner, Martin Riedler, Mario Ruthmair, 2020 .

On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes

Markus Leitner, Luís Gouveia, Ivana Ljubic, 2012, ISCO.

The connected facility location polytope

Juan José Salazar González, Markus Leitner, Ivana Ljubic, 2018, Discret. Appl. Math..

A polyhedral study of the diameter constrained minimum spanning tree problem

Markus Leitner, Ivana Ljubić, Luis Gouveia, 2020, Discret. Appl. Math..

Least cost influence propagation in (social) networks

Matteo Fischetti, Michele Monaci, Markus Leitner, 2018, Math. Program..

Large-scale influence maximization via maximal covering location

Markus Leitner, Markus Sinnl, Mario Ruthmair, 2021, Eur. J. Oper. Res..

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

Markus Leitner, Günther R. Raidl, 2011, J. Math. Model. Algorithms.

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

Markus Leitner, Markus Leitner, 2016, Comput. Oper. Res..

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

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

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

Juan José Salazar González, Markus Leitner, Ivana Ljubic, 2017, Eur. J. Oper. Res..

Overview of Optimization Problems in Electric Car-Sharing System Design and Management

Markus Leitner, Daniele Vigo, Jakob Puchinger, 2016 .

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

Markus Leitner, Ivana Ljubic, Martin Luipersbeck, 2014, Hybrid Metaheuristics.

Computing Generalized Minimum Spanning Trees with Variable Neighborhood Search

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

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

Markus Leitner, Günther R. Raidl, Bin Hu, 2008, J. Heuristics.

Hop constrained Steiner trees with multiple root nodes

Markus Leitner, Luís Gouveia, Ivana Ljubic, 2014, Eur. J. Oper. Res..

Determining optimal locations for charging stations of electric car-sharing systems under stochastic demand

Markus Leitner, Georg Brandstätter, Michael Kahr, 2017 .

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

Markus Leitner, Ivana Ljubic, Markus Sinnl, 2015, INFORMS J. Comput..

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

Markus Leitner, Ivana Ljubic, Markus Sinnl, 2016, Comput. Oper. Res..

Location of Charging Stations in Electric Car Sharing Systems

Markus Leitner, Ivana Ljubić, Georg Brandstätter, 2020, Transp. Sci..

Variable Neighborhood Search for Solving the Balanced Location Problem

Jozef Kratica, Markus Leitner, Ivana Ljubic, 2012, Electron. Notes Discret. Math..

Layered graph approaches for combinatorial optimization problems

Markus Leitner, Luís Gouveia, Mario Ruthmair, 2019, Comput. Oper. Res..

Self-forming Network Management Topologies in the Madeira Management System

Markus Leitner, Liam Fallon, Daryl Parker, 2007, AIMS.

Benders decomposition for competitive influence maximization in (social) networks

Markus Leitner, Markus Sinnl, Mario Ruthmair, 2020, Omega.

An Exact Method for (Constrained) Assortment Optimization Problems with Product Costs

Andrea Lodi, Markus Leitner, Roberto Roberti, 2021, 2109.03357.

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

Markus Leitner, Immanuel M. Bomze, Michael Kahr, 2020, Math. Oper. Res..

An Exact Method for Fortification Games pdf

Michele Monaci, Markus Leitner, Ivana Ljubic, 2021, ArXiv.

Preface: Special issue on network analytics and optimization

Markus Leitner, Luís Gouveia, Bernard Fortz, 2021, Networks.

Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem

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

Branch-and-Price for a Survivable Network Design Problem

Markus Leitner, Günther R. Raidl, Ulrich Pferschy, 2010 .

On Stabilized Branch-and-Price for Constrained Tree Problems

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

Stabilized Column Generation for the Rooted Delay-Constrained Steiner Tree Problem

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