On solving the rooted delay- and delay-variation-constrained Steiner tree problem
From MaRDI portal
Recommendations
- Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem
- Modeling and solving the rooted distance-constrained minimum spanning tree problem
- On the hop constrained Steiner tree problem with multiple root nodes
- Hop constrained Steiner trees with multiple root nodes
- A branch-and-cut algorithm for the Steiner tree problem with delays
Cited in
(10)- Delay-related secondary objectives for rectilinear Steiner minimum trees.
- Layered graph approaches for combinatorial optimization problems
- Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem
- Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems
- An exact algorithm for the Steiner tree problem with delays
- A layered graph model and an adaptive layers framework to solve delay-constrained minimum tree problems
- Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem
- Steiner trees with bounded RC-delay
- Stabilizing branch-and-price for constrained tree problems
- scientific article; zbMATH DE number 6264040 (Why is no real title available?)
This page was built for publication: On solving the rooted delay- and delay-variation-constrained Steiner tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3167627)
