Hop constrained Steiner trees with multiple root nodes
From MaRDI portal
Publication:299847
DOI10.1016/j.ejor.2013.11.029zbMath1338.90266OpenAlexW2119678763WikidataQ57705360 ScholiaQ57705360MaRDI QIDQ299847
Markus Leitner, Ivana Ljubić, Luís Gouveia
Publication date: 23 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.11.029
Related Items (14)
Layered graph approaches for combinatorial optimization problems ⋮ Branch-and-cut methods for the network design problem with vulnerability constraints ⋮ Load-dependent and precedence-based models for pickup and delivery problems ⋮ Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem ⋮ The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources ⋮ The rainbow Steiner tree problem ⋮ Extended formulation for hop constrained distribution network configuration problems ⋮ Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem ⋮ A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints ⋮ Cost additive rules in minimum cost spanning tree problems with multiple sources ⋮ Multi-level facility location problems ⋮ Distance Transformation for Network Design Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem
- An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees
- On implementing the push-relabel method for the maximum flow problem
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
- Modeling and solving the rooted distance-constrained minimum spanning tree problem
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
- On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes
- Structure in Approximation Classes
- On the hardness of approximating minimization problems
- Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
This page was built for publication: Hop constrained Steiner trees with multiple root nodes
