The following pages link to SteinLib (Q16253):
Displaying 50 items.
- A computational study on the maximum-weight bounded-degree rooted tree problem (Q2246469) (← links)
- Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities (Q2253496) (← links)
- A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem (Q2270325) (← links)
- A branch-and-cut algorithm for the maximum covering cycle problem (Q2288980) (← links)
- Building optimal Steiner trees on supercomputers by using up to 43,000 cores (Q2327281) (← links)
- Mixed-integer programming approaches for the tree \(t^*\)-spanner problem (Q2329685) (← links)
- Compiling CP subproblems to MDDs and d-DNNFs (Q2331104) (← links)
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions (Q2343089) (← links)
- Exact approaches for solving robust prize-collecting Steiner tree problems (Q2355891) (← links)
- Geometry-experiment algorithm for Steiner minimal tree problem (Q2375521) (← links)
- A branch and cut algorithm for the hierarchical network design problem (Q2379520) (← links)
- Mathematical programming approaches for dual multicast routing problem with multilayer risk cost (Q2393468) (← links)
- Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem (Q2434979) (← links)
- The Steiner connectivity problem (Q2434988) (← links)
- Coordinated cutting plane generation via multi-objective separation (Q2436641) (← links)
- Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing (Q2462555) (← links)
- Reduction tests for the prize-collecting Steiner problem (Q2466593) (← links)
- Viral systems: A new bio-inspired optimisation approach (Q2475843) (← links)
- Towards optimizing the deployment of optical access networks (Q2513732) (← links)
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem (Q2583134) (← links)
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice (Q2638387) (← links)
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems (Q2643947) (← links)
- Chvátal-Gomory cuts for the Steiner tree problem (Q2659072) (← links)
- The rainbow Steiner tree problem (Q2669791) (← links)
- Dual heuristics on the exact solution of large Steiner problems (Q2741494) (← links)
- Speeding Up Dynamic Programming with Representative Sets (Q2867093) (← links)
- Finding min-degree constrained spanning trees faster with a branch-and-cut algorithm (Q2883578) (← links)
- Strength of three MIP formulations for the prize collecting Steiner tree problem with a quota constraint (Q2883603) (← links)
- A Note on the Practicality of Maximal Planar Subgraph Algorithms (Q2961528) (← links)
- A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems (Q3009777) (← links)
- A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes (Q3091483) (← links)
- (Q3159363) (← links)
- Graphs and Algorithms in Communication Networks on Seven League Boots (Q3404458) (← 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)
- Chance‐constrained multi‐terminal network design problems (Q4632888) (← links)
- A Lagrangean-based decomposition approach for the link constrained Steiner tree problem (Q4637834) (← links)
- The Ubiquity Generator Framework: 7 Years of Progress in Parallelizing Branch-and-Bound (Q4685750) (← links)
- (Q4707782) (← links)
- Preprocessing Steiner problems from VLSI layout (Q4785218) (← links)
- (Q5009576) (← links)
- An Exact Algorithm for the Steiner Forest Problem (Q5009640) (← 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)
- Mathematical Programming Algorithms for Spatial Cloaking (Q5137955) (← links)
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints (Q5139851) (← links)
- (Q5140734) (← links)
- Learning in Combinatorial Optimization: What and How to Explore (Q5144784) (← links)
