 | 2011 |
|---|
| 10 |       | Markus Leitner,
Günther R. Raidl:
Variable Neighborhood and Greedy Randomized Adaptive Search for Capacitated Connected Facility Location.
EUROCAST (1) 2011: 295-302 |
| 9 | | Markus Leitner,
Mario Ruthmair,
Günther R. Raidl:
Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem.
INOC 2011: 124-138 |
| 8 | | Markus Leitner,
Günther R. Raidl:
Branch-and-Cut-and-Price for Capacitated Connected Facility Location.
J. Math. Model. Algorithms 10(3): 245-267 (2011) |
| 2010 |
|---|
| 7 | | Markus Leitner,
Günther R. Raidl:
Strong Lower Bounds for a Survivable Network Design Problem.
Electronic Notes in Discrete Mathematics 36: 295-302 (2010) |
| 6 | | Bin Hu,
Markus Leitner,
Günther R. Raidl:
The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search.
Networks 55(3): 256-275 (2010) |
| 2008 |
|---|
| 5 | | Markus Leitner,
Günther R. Raidl:
Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks.
Hybrid Metaheuristics 2008: 158-174 |
| 4 | | Markus Leitner,
Günther R. Raidl:
Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem.
SAINT 2008: 233-236 |
| 3 | | Bin Hu,
Markus Leitner,
Günther R. Raidl:
Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem.
J. Heuristics 14(5): 473-499 (2008) |
| 2007 |
|---|
| 2 | | Liam Fallon,
Daryl Parker,
Martin Zach,
Markus Leitner,
Sandra Collins:
Self-forming Network Management Topologies in the Madeira Management System.
AIMS 2007: 61-72 |
| 1 | | Markus Leitner,
Philipp Leitner,
Martin Zach,
Sandra Collins,
Claire Fahy:
Fault Management based on peer-to-peer paradigms; A case study report from the CELTIC project Madeira.
Integrated Network Management 2007: 697-700 |
Data released under the ODC-BY 1.0 license — See also our legal information page