Pages that link to "Item:Q5946826"
From MaRDI portal
The following pages link to Improved algorithms for the Steiner problem in networks (Q5946826):
Displayed 37 items.
- Optimality cuts and a branch-and-cut algorithm for the \(k\)-rooted mini-max spanning forest problem (Q319778) (← links)
- A partition-based relaxation for Steiner trees (Q535014) (← links)
- A multicast problem with shared risk cost (Q691394) (← links)
- Designing a road network for hazardous materials shipments (Q853892) (← links)
- Mathematical methods for physical layout of printed circuit boards: an overview (Q991814) (← links)
- Reformulations and solution algorithms for the maximum leaf spanning tree problem (Q993702) (← links)
- A robust and scalable algorithm for the Steiner problem in graphs (Q1646683) (← links)
- Decomposition methods for the two-stage stochastic Steiner tree problem (Q1744908) (← links)
- Solving minimum-cost shared arborescence problems (Q1751722) (← links)
- An algorithmic framework for the exact solution of tree-star problems (Q1753556) (← links)
- An exact solution framework for the minimum cost dominating tree problem (Q1800452) (← links)
- On Steiner trees and minimum spanning trees in hypergraphs (Q1869998) (← links)
- Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems (Q2226969) (← links)
- Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem (Q2434979) (← links)
- Reduction tests for the prize-collecting Steiner problem (Q2466593) (← links)
- Worst-case performance of Wong's Steiner tree heuristic (Q2489899) (← links)
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice (Q2638387) (← links)
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut (Q3430946) (← links)
- The Influence of Preprocessing on Steiner Tree Approximations (Q3467874) (← links)
- Approaches to the Steiner Problem in Networks (Q3637313) (← 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)
- Preprocessing Steiner problems from VLSI layout (Q4785218) (← links)
- On the Exact Solution of Prize-Collecting Steiner Tree Problems (Q5085996) (← links)
- A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems (Q5131733) (← links)
- A distributed dual ascent algorithm for Steiner problems in multicast routing (Q5191138) (← links)
- Distance Transformation for Network Design Problems (Q5231681) (← links)
- Strong Formulations for 2-Node-Connected Steiner Network Problems (Q5505657) (← links)
- (Q5708491) (← links)
- Implications, conflicts, and reductions for Steiner trees (Q5918437) (← links)
- Implications, conflicts, and reductions for Steiner trees (Q5925647) (← links)
- Steiner trees and polyhedra (Q5946818) (← links)
- A comparison of Steiner tree relaxations (Q5946825) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)
- Approximation algorithms for Steiner forest: An experimental study (Q6065858) (← links)
- A linear programming based approach to the Steiner tree problem with a fixed number of terminals (Q6068538) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)