Hop constrained Steiner trees with multiple root nodes
From MaRDI portal
Publication:299847
DOI10.1016/J.EJOR.2013.11.029zbMATH Open1338.90266OpenAlexW2119678763WikidataQ57705360 ScholiaQ57705360MaRDI QIDQ299847FDOQ299847
Authors: Markus Leitner, Ivana Ljubić, Luis 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
Recommendations
- On the hop constrained Steiner tree problem with multiple root nodes
- The Steiner tree problem with hop constraints
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
Cites Work
- Title not available (Why is that?)
- Structure in Approximation Classes
- On the hardness of approximating minimization problems
- 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
- Title not available (Why is that?)
- Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
- On formulations and methods for the hop-constrained minimum spanning tree problem
- 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
- 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
Cited In (26)
- The folk rule for minimum cost spanning tree problems with multiple sources
- Layered graph approaches for combinatorial optimization problems
- On Hop-Constrained Steiner Trees in Tree-Like Metrics
- On solving the rooted delay- and delay-variation-constrained Steiner tree problem
- Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem
- Extended formulation for hop constrained distribution network configuration problems
- Multi-level facility location problems
- Hop-constrained tree-shaped networks
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
- A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints
- Branch-and-cut methods for the network design problem with vulnerability constraints
- Distance transformation for network design problems
- Optimal Steiner trees under node and edge privacy conflicts
- Load-dependent and precedence-based models for pickup and delivery problems
- Solving Steiner trees: Recent advances, challenges, and perspectives
- Cost additive rules in minimum cost spanning tree problems with multiple sources
- The rainbow Steiner tree problem
- On the hop constrained Steiner tree problem with multiple root nodes
- Multi-Level Steiner Trees.
- Modelling the hop constrained connected facility location problem on layered graphs
- A computational study on integer programming formulations for hop-constrained survivable network design
- Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem
- A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints
- Local search for hop-constrained directed Steiner tree problem with application to UAV-based multi-target surveillance
- A formulation for a hop constrained survivable network design problem
This page was built for publication: Hop constrained Steiner trees with multiple root nodes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q299847)
