List of works - Markus Leitner

A Benders decomposition based framework for solving cable trench problems

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

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

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

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

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

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

Decomposition methods for the two-stage stochastic Steiner tree problem

scientific article published on 20 November 2017

Design of survivable networks with vulnerability constraints

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

article published in 2007

Hop constrained Steiner trees with multiple root nodes

article by Luis Gouveia et al published July 2014 in European Journal of Operational Research

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

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

scientific article published on 2 March 2016

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

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

scholarly article by Markus Leitner published January 2016 in Computers and Operations Research

Least cost influence propagation in (social) networks

article by Matteo Fischetti et al published 12 May 2018 in Mathematical Programming

On the Asymmetric Connected Facility Location Polytope

On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes

article by Luis Gouveia et al published 2012 in Lecture Notes in Computer Science

On the Two-Architecture Connected Facility Location Problem

scholarly article by Markus Leitner et al published June 2013 in Electronic Notes in Discrete Mathematics

Self-forming Network Management Topologies in the Madeira Management System

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

scholarly article by Markus Leitner et al published June 2013 in Electronic Notes in Discrete Mathematics

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

article by Markus Leitner et al published 2011 in Lecture Notes in Computer Science

Stabilizing branch-and-price for constrained tree problems

article by Markus Leitner et al published 20 September 2012 in Networks

Strong Lower Bounds for a Survivable Network Design Problem

The connected facility location polytope

scholarly article by Markus Leitner et al published January 2018 in Discrete Applied Mathematics

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

article published in 2010

The two-level diameter constrained spanning tree problem

article by Luis Gouveia et al published 12 January 2014 in Mathematical Programming

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

article

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

scientific article published in 2021

Variable Neighborhood Search for Solving the Balanced Location Problem

scholarly article by Jozef Kratica et al published December 2012 in Electronic Notes in Discrete Mathematics

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

scholarly article published July 2008

List of works by Markus Leitner