Markus Leitner

53 papers A* 1A 1C 4Journal 41Unranked 6

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Cover-based inequalities for the single-source capacitated facility location problem with customer preferences. Comput. Oper. Res. Christina Büsing, Markus Leitner, Sophia Wrede
2024	J	`jnl`	An Exact Method for (Constrained) Assortment Optimization Problems with Product Costs. INFORMS J. Comput. Markus Leitner, Andrea Lodi, Roberto Roberti, Claudio Sole
2024	J	`jnl`	The Impact of Passive Social Media Viewers in Influence Maximization. INFORMS J. Comput. Michael Kahr, Markus Leitner, Ivana Ljubic
2024	C	`conf`	Towards Multi-Fabric Garment Detection. INDIN Markus Leitner, Michael Teuchtmann
2023	J	`jnl`	An exact method for binary fortification games. Eur. J. Oper. Res. Markus Leitner, Ivana Ljubic, Michele Monaci, Markus Sinnl, Kübra Taninmis
2023	J	`jnl`	Multi-Depot Routing with Split Deliveries: Models and a Branch-and-Cut Algorithm. Transp. Sci. Luís Gouveia, Markus Leitner, Mario Ruthmair
2022	J	`jnl`	Arc Routing with Electric Vehicles: Dynamic Charging and Speed-Dependent Energy Consumption. Transp. Sci. Elena Fernández, Markus Leitner, Ivana Ljubic, Mario Ruthmair
2022	J	`jnl`	Grasping the Inconspicuous. CoRR Hrishikesh Gupta, Stefan Thalhammer, Markus Leitner, Markus Vincze
2021	J	`jnl`	An Exact Method for Fortification Games. CoRR Markus Leitner, Ivana Ljubic, Michele Monaci, Markus Sinnl, Kübra Taninmis
2021	J	`jnl`	Large-scale influence maximization via maximal covering location. Eur. J. Oper. Res. Evren Güney, Markus Leitner, Mario Ruthmair, Markus Sinnl
2021	A	`conf`	Object Learning for 6D Pose Estimation and Grasping from RGB-D Videos of In-hand Manipulation. IROS Timothy Patten, Kiru Park, Markus Leitner, Kevin Wolfram, Markus Vincze
2021	J	`jnl`	Preface: Special issue on network analytics and optimization. Networks Bernard Fortz, Luis Gouveia, Christina Büsing, Markus Leitner
2021	A*	`conf`	PyraPose: Feature Pyramids for Fast and Accurate Object Pose Estimation under Domain Shift. ICRA Stefan Thalhammer, Markus Leitner, Timothy Patten, Markus Vincze
2021	J	`jnl`	Trust Your Data or Not - StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization. Math. Oper. Res. Immanuel M. Bomze, Michael Kahr, Markus Leitner
2020	J	`jnl`	A polyhedral study of the diameter constrained minimum spanning tree problem. Discret. Appl. Math. Luis Gouveia, Markus Leitner, Ivana Ljubic
2020	J	`jnl`	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. Luis Gouveia, Markus Leitner, Mario Ruthmair, Ruslan Sadykov
2020	J	`jnl`	Location of Charging Stations in Electric Car Sharing Systems. Transp. Sci. Georg Brandstätter, Markus Leitner, Ivana Ljubic
2020	J	`jnl`	PyraPose: Feature Pyramids for Fast and Accurate Object Pose Estimation under Domain Shift. CoRR Stefan Thalhammer, Markus Leitner, Timothy Patten, Markus Vincze
2019	J	`jnl`	Exact Approaches for Network Design Problems with Relays. INFORMS J. Comput. Markus Leitner, Ivana Ljubic, Martin Riedler, Mario Ruthmair
2019	J	`jnl`	Layered graph approaches for combinatorial optimization problems. Comput. Oper. Res. Luis Gouveia, Markus Leitner, Mario Ruthmair
2018	J	`jnl`	A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems. INFORMS J. Comput. Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl
2018	J	`jnl`	Branch-and-cut methods for the Network Design Problem with Vulnerability Constraints. Comput. Oper. Res. Luís Gouveia, Martim Joyce-Moniz, Markus Leitner
2018	J	`jnl`	Decomposition methods for the two-stage stochastic Steiner tree problem. Comput. Optim. Appl. Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl
2018	J	`jnl`	Least cost influence propagation in (social) networks. Math. Program. Matteo Fischetti, Michael Kahr, Markus Leitner, Michele Monaci, Mario Ruthmair
2018	J	`jnl`	The connected facility location polytope. Discret. Appl. Math. Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl
2017	J	`jnl`	A Benders decomposition based framework for solving cable trench problems. Comput. Oper. Res. Hatice Calik, Markus Leitner, Martin Luipersbeck
2017	J	`jnl`	An algorithmic framework for the exact solution of tree-star problems. Eur. J. Oper. Res. Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl
2017	J	`jnl`	Design of survivable networks with vulnerability constraints. Eur. J. Oper. Res. Luis Gouveia, Markus Leitner
2017	J	`jnl`	Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem. Eur. J. Oper. Res. Luis Eduardo Neves Gouveia, Markus Leitner, Mario Ruthmair
2017	J	`jnl`	Thinning out Steiner trees: a node-based model for uniform edge costs. Math. Program. Comput. Matteo Fischetti, Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Michele Monaci, Max Resch, Domenico Salvagnin, Markus Sinnl
2016	J	`jnl`	ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design. Comput. Oper. Res. Markus Leitner, Ivana Ljubic, Markus Sinnl, Axel Werner
2016	J	`jnl`	Integer programming models and branch-and-cut approaches to generalized {0, 1, 2}-survivable network design problems. Comput. Optim. Appl. Markus Leitner
2016	J	`jnl`	Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem. Comput. Oper. Res. Markus Leitner
2015	J	`jnl`	A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem. INFORMS J. Comput. Markus Leitner, Ivana Ljubic, Markus Sinnl
2015	J	`jnl`	The two-level diameter constrained spanning tree problem. Math. Program. Luis Eduardo Neves Gouveia, Markus Leitner, Ivana Ljubic
2014	—	`conf`	A Partition-Based Heuristic for the Steiner Tree Problem in Large Graphs. Hybrid Metaheuristics Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Max Resch
2014	J	`jnl`	Hop constrained Steiner trees with multiple root nodes. Eur. J. Oper. Res. Luis Eduardo Neves Gouveia, Markus Leitner, Ivana Ljubic
2014	C	`conf`	On the Asymmetric Connected Facility Location Polytope. ISCO Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl
2013	J	`jnl`	On the Two-Architecture Connected Facility Location Problem. Electron. Notes Discret. Math. Markus Leitner, Ivana Ljubic, Markus Sinnl, Axel Werner
2013	J	`jnl`	Solving the bi-objective prize-collecting Steiner tree problem with the ϵ-constraint method. Electron. Notes Discret. Math. Markus Leitner, Ivana Ljubic, Markus Sinnl
2013	J	`jnl`	Stabilizing branch-and-price for constrained tree problems. Networks Markus Leitner, Mario Ruthmair, Günther R. Raidl
2012	C	`conf`	On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes. ISCO Luis Eduardo Neves Gouveia, Markus Leitner, Ivana Ljubic
2012	J	`jnl`	Variable Neighborhood Search for Solving the Balanced Location Problem. Electron. Notes Discret. Math. Jozef Kratica, Markus Leitner, Ivana Ljubic
2011	J	`jnl`	Branch-and-Cut-and-Price for Capacitated Connected Facility Location. J. Math. Model. Algorithms Markus Leitner, Günther R. Raidl
2011	C	`conf`	Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem. INOC Markus Leitner, Mario Ruthmair, Günther R. Raidl
2011	—	`conf`	Variable Neighborhood and Greedy Randomized Adaptive Search for Capacitated Connected Facility Location. EUROCAST (1) Markus Leitner, Günther R. Raidl
2010	J	`jnl`	Strong Lower Bounds for a Survivable Network Design Problem. Electron. Notes Discret. Math. Markus Leitner, Günther R. Raidl
2010	J	`jnl`	The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search. Networks Bin Hu, Markus Leitner, Günther R. Raidl
2008	J	`jnl`	Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. J. Heuristics Bin Hu, Markus Leitner, Günther R. Raidl
2008	—	`conf`	Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks. Hybrid Metaheuristics Markus Leitner, Günther R. Raidl
2008	—	`conf`	Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem. SAINT Markus Leitner, Günther R. Raidl
2007	—	`conf`	Fault Management based on peer-to-peer paradigms; A case study report from the CELTIC project Madeira. Integrated Network Management Markus Leitner, Philipp Leitner, Martin Zach, Sandra Collins, Claire Fahy
2007	—	`conf`	Self-forming Network Management Topologies in the Madeira Management System. AIMS Liam Fallon, Daryl Parker, Martin Zach, Markus Leitner, Sandra Collins