Markus Leitner
Markus Leitner
Vrije Universiteit Amsterdam, School of Business & Economics, Department of Supply Chain Analytics
Verified email at vu.nl - Homepage
TitleCited byYear
Thinning out Steiner trees: a node-based model for uniform edge costs
M Fischetti, M Leitner, I Ljubic, M Luipersbeck, M Monaci, M Resch, ...
58*
Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
B Hu, M Leitner, GR Raidl
Journal of Heuristics 14 (5), 473-499, 2008
502008
Determining optimal locations for charging stations of electric car-sharing systems under stochastic demand
G Brandstätter, M Kahr, M Leitner
Transportation Research Part B: Methodological 104, 17-35, 2017
362017
Branch-and-cut-and-price for capacitated connected facility location
M Leitner, GR Raidl
Journal of Mathematical Modelling and Algorithms 10 (3), 245-267, 2011
332011
Lagrangian decomposition, metaheuristics, and hybrid approaches for the design of the last mile in fiber optic networks
M Leitner, GR Raidl
International Workshop on Hybrid Metaheuristics, 158-174, 2008
282008
Overview of Optimization Problems in Electric Car-Sharing System Design and Management
G Brandstätter, C Gambella, M Leitner, E Malaguti, F Masini, J Puchinger, ...
Dynamic Perspectives on Managerial Decision Making, 441-471, 2016
252016
Hop constrained Steiner trees with multiple root nodes
L Gouveia, M Leitner, I Ljubić
European Journal of Operational Research 236 (1), 100-112, 2014
232014
Self-forming Network Management Topologies in the Madeira Management System
L Fallon, D Parker, M Zach, M Leitner, S Collins
Inter-Domain Management, 61-72, 2007
152007
A dual-ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems
M Leitner, I Ljubic, M Luipersbeck, M Sinnl
15*
Stabilizing branch‐and‐price for constrained tree problems
M Leitner, M Ruthmair, GR Raidl
Networks 61 (2), 150-170, 2013
14*2013
The two-level diameter constrained spanning tree problem
L Gouveia, M Leitner, I Ljubić
Mathematical Programming 150 (1), 49-78, 2012
142012
Strong lower bounds for a survivable network design problem
M Leitner, GR Raidl
Electronic Notes in Discrete Mathematics 36, 295-302, 2010
142010
Combining Lagrangian decomposition with very large scale neighborhoood search for capacitated connected facility location
M Leitner, GR Raidl
Post-Conference Book of the Eight Metaheuristics International Conference–MIC, 2009
142009
A computational study of exact approaches for the bi-objective prize-collecting steiner tree problem
M Leitner, I Ljubić, M Sinnl
INFORMS Journal on Computing 27 (1), 118-134, 2015
13*2015
Stabilized branch-and-price for the rooted delay-constrained Steiner tree problem
M Leitner, M Ruthmair, GR Raidl
International Conference on Network Optimization, 124-138, 2011
132011
Variable neighborhood search for a prize collecting capacity constrained connected facility location problem
M Leitner, GR Raidl
Applications and the Internet, 2008. SAINT 2008. International Symposium on …, 2008
132008
Fault management based on peer-to-peer paradigms; a case study report from the celtic project madeira
M Leitner, P Leitner, M Zach, S Collins, C Fahy
2007 10th IFIP/IEEE International Symposium on Integrated Network Management …, 2007
132007
Extended Formulations and Branch-and-Cut Algorithms for the Black-and-White Traveling Salesman Problem
L Gouveia, M Leitner, M Ruthmair
European Journal of Operational Research, 2017
122017
On the Two-Architecture Connected Facility Location Problem.
M Leitner, I Ljubic, M Sinnl, A Werner
Electronic Notes in Discrete Mathematics 41, 359-366, 2013
122013
Computing generalized minimum spanning trees with variable neighborhood search
B Hu, M Leitner, GR Raidl
Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search …, 2005
122005
The system can't perform the operation now. Try again later.
Articles 1–20