Markus Leitner
Orcid: 0000-0002-3313-9610Affiliations:
- Vrije Universiteit Amsterdam, The Netherlands
- University of Vienna, Austria (former)
According to our database1,
Markus Leitner
authored at least 51 papers
between 2007 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2008
2010
2012
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
7
2
2
2
4
3
2
5
5
3
2
1
3
1
1
2
1
1
2
2
1
2
2
2
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on d-nb.info
On csauthors.net:
Bibliography
2024
An Exact Method for (Constrained) Assortment Optimization Problems with Product Costs.
INFORMS J. Comput., 2024
INFORMS J. Comput., 2024
Proceedings of the 22nd IEEE International Conference on Industrial Informatics, 2024
2023
Transp. Sci., March, 2023
2022
Arc Routing with Electric Vehicles: Dynamic Charging and Speed-Dependent Energy Consumption.
Transp. Sci., 2022
2021
Trust Your Data or Not - StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization.
Math. Oper. Res., 2021
Eur. J. Oper. Res., 2021
Object Learning for 6D Pose Estimation and Grasping from RGB-D Videos of In-hand Manipulation.
Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 2021
PyraPose: Feature Pyramids for Fast and Accurate Object Pose Estimation under Domain Shift.
Proceedings of the IEEE International Conference on Robotics and Automation, 2021
2020
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].
Eur. J. Oper. Res., 2020
Discret. Appl. Math., 2020
2019
Comput. Oper. Res., 2019
2018
A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems.
INFORMS J. Comput., 2018
Branch-and-cut methods for the Network Design Problem with Vulnerability Constraints.
Comput. Oper. Res., 2018
Comput. Optim. Appl., 2018
2017
Math. Program. Comput., 2017
Eur. J. Oper. Res., 2017
Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem.
Eur. J. Oper. Res., 2017
Eur. J. Oper. Res., 2017
Comput. Oper. Res., 2017
2016
ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design.
Comput. Oper. Res., 2016
Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem.
Comput. Oper. Res., 2016
Integer programming models and branch-and-cut approaches to generalized {0, 1, 2}-survivable network design problems.
Comput. Optim. Appl., 2016
2015
A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem.
INFORMS J. Comput., 2015
2014
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014
Proceedings of the Hybrid Metaheuristics - 9th International Workshop, HM 2014, 2014
2013
Electron. Notes Discret. Math., 2013
Solving the bi-objective prize-collecting Steiner tree problem with the ϵ-constraint method.
Electron. Notes Discret. Math., 2013
2012
Electron. Notes Discret. Math., 2012
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012
2011
J. Math. Model. Algorithms, 2011
Proceedings of the Network Optimization - 5th International Conference, 2011
Variable Neighborhood and Greedy Randomized Adaptive Search for Capacitated Connected Facility Location.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2011, 2011
2010
The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search.
Networks, 2010
Electron. Notes Discret. Math., 2010
2008
Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem.
J. Heuristics, 2008
Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem.
Proceedings of the 2008 International Symposium on Applications and the Internet, 2008
Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks.
Proceedings of the Hybrid Metaheuristics, 5th International Workshop, 2008
2007
Fault Management based on peer-to-peer paradigms; A case study report from the CELTIC project Madeira.
Proceedings of the Integrated Network Management, 2007
Proceedings of the Inter-Domain Management, 2007