The following pages link to Markus Leitner (Q299845):
Displayed 33 items.
- Hop constrained Steiner trees with multiple root nodes (Q299847) (← links)
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems (Q316168) (← links)
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem (Q342101) (← links)
- ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design (Q342390) (← links)
- Branch-and-cut-and-price for capacitated connected facility location (Q662139) (← links)
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem (Q953318) (← links)
- Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
- Least cost influence propagation in (social) networks (Q1650779) (← links)
- A Benders decomposition based framework for solving cable trench problems (Q1652230) (← links)
- Branch-and-cut methods for the network design problem with vulnerability constraints (Q1652559) (← links)
- Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem (Q1683126) (← links)
- The connected facility location polytope (Q1686059) (← links)
- Design of survivable networks with vulnerability constraints (Q1698886) (← links)
- Thinning out Steiner trees: a node-based model for uniform edge costs (Q1699615) (← links)
- Decomposition methods for the two-stage stochastic Steiner tree problem (Q1744908) (← links)
- An algorithmic framework for the exact solution of tree-star problems (Q1753556) (← links)
- Large-scale influence maximization via maximal covering location (Q2028806) (← links)
- Corrigendum to: ``Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem'' (Q2184081) (← links)
- A polyhedral study of the diameter constrained minimum spanning tree problem (Q2197445) (← links)
- The two-level diameter constrained spanning tree problem (Q2340278) (← links)
- Variable Neighborhood Search for Solving the Balanced Location Problem (Q2840746) (← links)
- Strong Lower Bounds for a Survivable Network Design Problem (Q2883576) (← links)
- A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem (Q2942688) (← links)
- The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search (Q3057152) (← links)
- Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem (Q3091493) (← links)
- On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes (Q3167625) (← links)
- On the Asymmetric Connected Facility Location Polytope (Q3195346) (← links)
- Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization (Q4991677) (← links)
- A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems (Q5131733) (← links)
- Exact Approaches for Network Design Problems with Relays (Q5137444) (← links)
- Stabilizing branch‐and‐price for constrained tree problems (Q5326785) (← links)
- An exact method for binary fortification games (Q6167322) (← links)
- An Exact Method for (Constrained) Assortment Optimization Problems with Product Costs (Q6377084) (← links)