Markus Leitner

Available identifiers

zbMath Open leitner.markusWikidataQ56524097 ScholiaQ56524097MaRDI QIDQ299845

List of research outcomes

Publication	Date of Publication	Type
An exact method for binary fortification games	2023-07-10	Paper
An Exact Method for (Constrained) Assortment Optimization Problems with Product Costs	2021-09-07	Paper
Large-scale influence maximization via maximal covering location	2021-06-03	Paper
Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization	2021-06-03	Paper
Exact Approaches for Network Design Problems with Relays	2020-12-02	Paper
A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems	2020-11-09	Paper
A polyhedral study of the diameter constrained minimum spanning tree problem	2020-08-31	Paper
Corrigendum to: ``Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem	2020-05-27	Paper
Layered graph approaches for combinatorial optimization problems	2018-12-03	Paper
Least cost influence propagation in (social) networks	2018-07-13	Paper
A Benders decomposition based framework for solving cable trench problems	2018-07-11	Paper
Branch-and-cut methods for the network design problem with vulnerability constraints	2018-07-11	Paper
An algorithmic framework for the exact solution of tree-star problems	2018-05-29	Paper
Decomposition methods for the two-stage stochastic Steiner tree problem	2018-04-20	Paper
Thinning out Steiner trees: a node-based model for uniform edge costs	2018-02-23	Paper
Design of survivable networks with vulnerability constraints	2018-02-16	Paper
The connected facility location polytope	2017-12-20	Paper
Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem	2017-12-06	Paper
Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem	2016-11-17	Paper
ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design	2016-11-17	Paper
Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems	2016-09-26	Paper
Hop constrained Steiner trees with multiple root nodes	2016-06-23	Paper
On the Asymmetric Connected Facility Location Polytope	2015-10-16	Paper
A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem	2015-09-11	Paper
The two-level diameter constrained spanning tree problem	2015-04-16	Paper
Stabilizing branch‐and‐price for constrained tree problems	2013-08-06	Paper
Variable Neighborhood Search for Solving the Balanced Location Problem	2013-07-23	Paper
On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes	2012-11-02	Paper
Strong Lower Bounds for a Survivable Network Design Problem	2012-05-13	Paper
Branch-and-cut-and-price for capacitated connected facility location	2012-02-21	Paper
Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem	2011-09-09	Paper
The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search	2010-11-24	Paper
Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem	2008-11-17	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Markus Leitner