default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarkus Leitner
Person information
- affiliation: Vrije Universiteit Amsterdam, The Netherlands
- affiliation (former): University of Vienna, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j37]Markus Leitner
, Andrea Lodi, Roberto Roberti, Claudio Sole:
An Exact Method for (Constrained) Assortment Optimization Problems with Product Costs. INFORMS J. Comput. 36(2): 479-494 (2024)- [j36]Michael Kahr, Markus Leitner, Ivana Ljubic:
The Impact of Passive Social Media Viewers in Influence Maximization. INFORMS J. Comput. 36(6): 1362-1381 (2024) - [c12]Markus Leitner, Michael Teuchtmann:
Towards Multi-Fabric Garment Detection. INDIN 2024: 1-6 - 2023
- [j35]Markus Leitner, Ivana Ljubic, Michele Monaci, Markus Sinnl, Kübra Taninmis:
An exact method for binary fortification games. Eur. J. Oper. Res. 307(3): 1026-1039 (2023) - [j34]Luís Gouveia, Markus Leitner, Mario Ruthmair:
Multi-Depot Routing with Split Deliveries: Models and a Branch-and-Cut Algorithm. Transp. Sci. 57(2): 512-530 (2023) - 2022
- [j33]Elena Fernández, Markus Leitner, Ivana Ljubic, Mario Ruthmair:
Arc Routing with Electric Vehicles: Dynamic Charging and Speed-Dependent Energy Consumption. Transp. Sci. 56(5): 1219-1237 (2022) - [i3]Hrishikesh Gupta, Stefan Thalhammer, Markus Leitner, Markus Vincze:
Grasping the Inconspicuous. CoRR abs/2211.08182 (2022) - 2021
- [j32]Evren Güney, Markus Leitner, Mario Ruthmair, Markus Sinnl:
Large-scale influence maximization via maximal covering location. Eur. J. Oper. Res. 289(1): 144-164 (2021) - [j31]Immanuel M. Bomze, Michael Kahr, Markus Leitner:
Trust Your Data or Not - StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization. Math. Oper. Res. 46(1): 301-316 (2021) - [j30]Bernard Fortz, Luis Gouveia, Christina Büsing, Markus Leitner:
Preface: Special issue on network analytics and optimization. Networks 77(4): 475-476 (2021) - [c11]Stefan Thalhammer, Markus Leitner, Timothy Patten, Markus Vincze:
PyraPose: Feature Pyramids for Fast and Accurate Object Pose Estimation under Domain Shift. ICRA 2021: 13909-13915 - [c10]Timothy Patten, Kiru Park, Markus Leitner, Kevin Wolfram, Markus Vincze:
Object Learning for 6D Pose Estimation and Grasping from RGB-D Videos of In-hand Manipulation. IROS 2021: 4831-4838 - [i2]Markus Leitner, Ivana Ljubic, Michele Monaci, Markus Sinnl, Kübra Taninmis:
An Exact Method for Fortification Games. CoRR abs/2111.13400 (2021) - 2020
- [j29]Luis Gouveia, Markus Leitner, Ivana Ljubic:
A polyhedral study of the diameter constrained minimum spanning tree problem. Discret. Appl. Math. 285: 364-379 (2020) - [j28]Luis Gouveia, Markus Leitner, Mario Ruthmair, Ruslan Sadykov:
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. 285(3): 1199-1203 (2020) - [j27]Georg Brandstätter, Markus Leitner, Ivana Ljubic:
Location of Charging Stations in Electric Car Sharing Systems. Transp. Sci. 54(5): 1408-1438 (2020) - [i1]Stefan Thalhammer, Markus Leitner, Timothy Patten, Markus Vincze:
PyraPose: Feature Pyramids for Fast and Accurate Object Pose Estimation under Domain Shift. CoRR abs/2010.16117 (2020)
2010 – 2019
- 2019
- [j26]Luis Gouveia, Markus Leitner, Mario Ruthmair:
Layered graph approaches for combinatorial optimization problems. Comput. Oper. Res. 102: 22-38 (2019) - [j25]Markus Leitner, Ivana Ljubic, Martin Riedler, Mario Ruthmair:
Exact Approaches for Network Design Problems with Relays. INFORMS J. Comput. 31(1): 171-192 (2019) - 2018
- [j24]Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl:
Decomposition methods for the two-stage stochastic Steiner tree problem. Comput. Optim. Appl. 69(3): 713-752 (2018) - [j23]Luís Gouveia, Martim Joyce-Moniz, Markus Leitner:
Branch-and-cut methods for the Network Design Problem with Vulnerability Constraints. Comput. Oper. Res. 91: 190-208 (2018) - [j22]Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl:
The connected facility location polytope. Discret. Appl. Math. 234: 151-167 (2018) - [j21]Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl:
A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems. INFORMS J. Comput. 30(2): 402-420 (2018) - [j20]Matteo Fischetti, Michael Kahr, Markus Leitner, Michele Monaci, Mario Ruthmair:
Least cost influence propagation in (social) networks. Math. Program. 170(1): 293-325 (2018) - 2017
- [j19]Hatice Calik, Markus Leitner, Martin Luipersbeck:
A Benders decomposition based framework for solving cable trench problems. Comput. Oper. Res. 81: 128-140 (2017) - [j18]Luis Gouveia, Markus Leitner:
Design of survivable networks with vulnerability constraints. Eur. J. Oper. Res. 258(1): 89-103 (2017) - [j17]Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl:
An algorithmic framework for the exact solution of tree-star problems. Eur. J. Oper. Res. 261(1): 54-66 (2017) - [j16]Luis Eduardo Neves Gouveia, Markus Leitner, Mario Ruthmair:
Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem. Eur. J. Oper. Res. 262(3): 908-928 (2017) - [j15]Matteo Fischetti, Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Michele Monaci, Max Resch, Domenico Salvagnin, Markus Sinnl:
Thinning out Steiner trees: a node-based model for uniform edge costs. Math. Program. Comput. 9(2): 203-229 (2017) - 2016
- [j14]Markus Leitner:
Integer programming models and branch-and-cut approaches to generalized {0, 1, 2}-survivable network design problems. Comput. Optim. Appl. 65(1): 73-92 (2016) - [j13]Markus Leitner:
Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem. Comput. Oper. Res. 65: 1-18 (2016) - [j12]Markus Leitner, Ivana Ljubic, Markus Sinnl, Axel Werner:
ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design. Comput. Oper. Res. 72: 128-146 (2016) - 2015
- [j11]Markus Leitner, Ivana Ljubic, Markus Sinnl:
A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem. INFORMS J. Comput. 27(1): 118-134 (2015) - [j10]Luis Eduardo Neves Gouveia, Markus Leitner, Ivana Ljubic:
The two-level diameter constrained spanning tree problem. Math. Program. 150(1): 49-78 (2015) - 2014
- [j9]Luis Eduardo Neves Gouveia, Markus Leitner, Ivana Ljubic:
Hop constrained Steiner trees with multiple root nodes. Eur. J. Oper. Res. 236(1): 100-112 (2014) - [c9]Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Max Resch:
A Partition-Based Heuristic for the Steiner Tree Problem in Large Graphs. Hybrid Metaheuristics 2014: 56-70 - [c8]Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl:
On the Asymmetric Connected Facility Location Polytope. ISCO 2014: 371-383 - 2013
- [j8]Markus Leitner, Ivana Ljubic, Markus Sinnl:
Solving the bi-objective prize-collecting Steiner tree problem with the ϵ-constraint method. Electron. Notes Discret. Math. 41: 181-188 (2013) - [j7]Markus Leitner, Ivana Ljubic, Markus Sinnl, Axel Werner:
On the Two-Architecture Connected Facility Location Problem. Electron. Notes Discret. Math. 41: 359-366 (2013) - [j6]Markus Leitner, Mario Ruthmair, Günther R. Raidl:
Stabilizing branch-and-price for constrained tree problems. Networks 61(2): 150-170 (2013) - 2012
- [j5]Jozef Kratica, Markus Leitner, Ivana Ljubic:
Variable Neighborhood Search for Solving the Balanced Location Problem. Electron. Notes Discret. Math. 39: 21-28 (2012) - [c7]Luis Eduardo Neves Gouveia, Markus Leitner, Ivana Ljubic:
On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes. ISCO 2012: 201-212 - 2011
- [j4]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) - [c6]Markus Leitner, Günther R. Raidl:
Variable Neighborhood and Greedy Randomized Adaptive Search for Capacitated Connected Facility Location. EUROCAST (1) 2011: 295-302 - [c5]Markus Leitner, Mario Ruthmair, Günther R. Raidl:
Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem. INOC 2011: 124-138 - 2010
- [j3]Markus Leitner, Günther R. Raidl:
Strong Lower Bounds for a Survivable Network Design Problem. Electron. Notes Discret. Math. 36: 295-302 (2010) - [j2]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)
2000 – 2009
- 2008
- [j1]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) - [c4]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 - [c3]Markus Leitner, Günther R. Raidl:
Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem. SAINT 2008: 233-236 - 2007
- [c2]Liam Fallon, Daryl Parker, Martin Zach, Markus Leitner, Sandra Collins:
Self-forming Network Management Topologies in the Madeira Management System. AIMS 2007: 61-72 - [c1]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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
