SteinLib

swMATH4066MaRDI QIDQ16253FDOQ16253

Author name not available (Why is that?)

Described by source

• Solving Steiner tree problems in graphs to optimality

Cited In (only showing first 100 items - show all)

• Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities
• Steiner tree packing revisited
• Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
• Solving Steiner tree problems in graphs with Lagrangian relaxation
• Speeding Up Dynamic Programming with Representative Sets
• PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
• The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation
• Mixed-integer programming techniques for the connected max-\(k\)-cut problem
• A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem
• An exact combinatorial algorithm for minimum graph bisection
• Delay-related secondary objectives for rectilinear Steiner minimum trees.
• Dual heuristics on the exact solution of large Steiner problems
• Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing
• A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems
• Binary Steiner trees: structural results and an exact solution approach
• Optimal capacitated ring trees
• Finding min-degree constrained spanning trees faster with a branch-and-cut algorithm
• Mathematical methods for physical layout of printed circuit boards: an overview
• A branch-and-cut algorithm for the Steiner tree problem with delays
• Title not available (Why is that?)
• Reduction tests for the prize-collecting Steiner problem
• A note on the generalized Steiner tree polytope
• Strong lower bounds for the prize collecting Steiner problem in graphs
• MIP models for connected facility location: a theoretical and computational study
• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
• A Distributed Primal-Dual Heuristic for Steiner Problems in Networks
• Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
• The Ubiquity Generator Framework: 7 Years of Progress in Parallelizing Branch-and-Bound
• A Note on the Practicality of Maximal Planar Subgraph Algorithms
• The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
• Approaches to the Steiner Problem in Networks
• Benders decomposition of the passive optical network design problem
• A comparison of Steiner tree relaxations
• Improved algorithms for the Steiner problem in networks
• Combinatorial optimization in system configuration design
• Viral systems: A new bio-inspired optimisation approach
• On exact solutions for the minmax regret spanning tree problem
• The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
• Preprocessing Steiner problems from VLSI layout
• A branch-and-cut algorithm for the maximum covering cycle problem
• Generating new test instances by evolving in instance space
• ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design
• Reformulations and solution algorithms for the maximum leaf spanning tree problem
• A distributed dual ascent algorithm for Steiner problems in multicast routing
• Exact approaches for solving robust prize-collecting Steiner tree problems
• A practical greedy approximation for the directed Steiner tree problem
• Directed Steiner trees with diffusion costs
• Tree network design avoiding congestion
• The Steiner tree problem with delays: a compact formulation and reduction procedures
• Generalized network design problems.
• Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
• Towards optimizing the deployment of optical access networks
• Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem
• Learning in Combinatorial Optimization: What and How to Explore
• A branch and cut algorithm for the hierarchical network design problem
• Computing skeletons for rectilinearly convex obstacles in the rectilinear plane
• An algorithmic framework for the exact solution of tree-star problems
• Title not available (Why is that?)
• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
• Optimizing splitter and fiber location in a multilevel optical FTTH network
• Exact methods for solving the elementary shortest and longest path problems
• A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints
• SCIP-Jack -- a solver for STP and variants with parallelization extensions
• The dynamic predicate stashing copy problem and the Steiner problem in graphs
• Coordinated cutting plane generation via multi-objective separation
• Thinning out Steiner trees: a node-based model for uniform edge costs
• Optimal design of hierarchical networks with free main path extremes
• Computational Integer Programming and Cutting Planes
• Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
• Title not available (Why is that?)
• On Steiner trees and minimum spanning trees in hypergraphs
• On the Exact Solution of Prize-Collecting Steiner Tree Problems
• The Steiner connectivity problem
• New Reduction Techniques for the Group Steiner Tree Problem
• Strategyproof auction mechanisms for network procurement
• Building optimal Steiner trees on supercomputers by using up to 43,000 cores
• Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions
• Distance Transformation for Network Design Problems
• A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
• Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems
• Title not available (Why is that?)
• Stronger MIP formulations for the Steiner forest problem
• The Influence of Preprocessing on Steiner Tree Approximations
• Chvátal-Gomory cuts for the Steiner tree problem
• Title not available (Why is that?)
• Implications, conflicts, and reductions for Steiner trees
• Implications, conflicts, and reductions for Steiner trees
• Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
• Mixed-integer programming approaches for the time-constrained maximal covering routing problem
• Solving minimum-cost shared arborescence problems
• Decomposition methods for the two-stage stochastic Steiner tree problem
• A computational study on the maximum-weight bounded-degree rooted tree problem
• Mathematical Programming Algorithms for Spatial Cloaking
• A robust and scalable algorithm for the Steiner problem in graphs
• Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
• Title not available (Why is that?)
• Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach
• Mixed-integer programming approaches for the tree \(t^*\)-spanner problem
• Geometry-experiment algorithm for Steiner minimal tree problem
• Algorithmic expedients for the prize collecting Steiner tree problem

This page was built for software: SteinLib