People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
Markus Leitner
Recent Publications
Exact approaches for the directed network design problem with relays
2018
Exact Approaches for Network Design Problems with Relays
2015
Stabilizing Branch-and-Price for Constrained Tree Problems
2013
Variable Neighborhood and Greedy Randomized Adaptive Search for Capacitated Connected Facility Location
2012
Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem
2011
Stabilized Column Generation for the Rooted Delay-Constrained Steiner Tree Problem
2011
Branch-and-Cut-and-Price for Capacitated Connected Facility Location
2011
On Stabilized Branch-and-Price for Constrained Tree Problems
2011
Variable Neighborhood Search for Capacitated Connected Facility Location
2011
Solving Two Network Design Problems by Mixed Integer Programming and Hybrid Optimization Methods
2010
Strong Lower Bounds for a Survivable Network Design Problem
2010
The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Search
2010
Accelerating Column Generation for a Survivable Network Design Problem
2009
A Lagrangian Decomposition Based Heuristic for Capacitated Connected Facility Location
2009
Combining Lagrangian Decomposition with Very Large Scale Neighborhood Search for Capacitated Connected Facility Location
2009
Combining Lagrangian Decomposition with Very Large Scale Neighborhoood Search for Capacitated Connected Facility Location
2009
Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem
2008
Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks
2008
Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem
2008
Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem
2007
Solving Two Generalized Network Design Problems with Exact and Heuristic Methods
2006
Computing Generalized Minimum Spanning Trees with Variable Neighborhood Search
2005
Cite
×