Pages that link to "Item:Q1646683"
From MaRDI portal
The following pages link to A robust and scalable algorithm for the Steiner problem in graphs (Q1646683):
Displaying 14 items.
- SCIP-Jack -- a solver for STP and variants with parallelization extensions (Q1699618) (← links)
- Swap-vertex based neighborhood for Steiner tree problems (Q1699620) (← links)
- Decomposition methods for the two-stage stochastic Steiner tree problem (Q1744908) (← links)
- Integer programming formulations for the shared multicast tree problem (Q2331596) (← links)
- The rainbow Steiner tree problem (Q2669791) (← links)
- A hybrid GRASP with perturbations for the Steiner problem in graphs (Q2884534) (← links)
- The Influence of Preprocessing on Steiner Tree Approximations (Q3467874) (← links)
- A fast algorithm for computing steiner edge connectivity (Q3581294) (← links)
- Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem (Q4620424) (← links)
- Strong Steiner Tree Approximations in Practice (Q4629541) (← links)
- Implications, conflicts, and reductions for Steiner trees (Q5918437) (← links)
- Implications, conflicts, and reductions for Steiner trees (Q5925647) (← links)
- Robust Algorithms for TSP and Steiner Tree (Q6075747) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
