SteinLib

swMATH4066MaRDI QIDQ16253FDOQ16253

Author name not available (Why is that?)

Official website: https://steinlib.zib.de/steinlib.php

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
• Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
• Solving Steiner tree problems in graphs with Lagrangian relaxation
• 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
• Learning in combinatorial optimization: what and how to explore
• 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
• 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
• 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
• 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
• Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
• 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
• BRITE
• OGDF
• FiberSCIP
• A comparison of Steiner tree relaxations
• Improved algorithms for the Steiner problem in networks
• DIMACS
• Treewidthlib
• BEAVER
• LinTim
• ROPI
• DryadOpt
• ParaXpress
• K_TREE/K_SUBGRAPH
• TimberWolf
• 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
• SCIP-Jack
• PPBB
• BPPLIB
• SSTPLib
• LINERLIB
• lop.gms
• stprbh
• k-Vertex-Cut-Problem
• Preprocessing Steiner problems from VLSI layout
• A branch-and-cut algorithm for the maximum covering cycle problem
• OpenGraphGym
• 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
• 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
• Speeding up dynamic programming with representative sets. An experimental evaluation of algorithms for Steiner Tree on tree decompositions
• 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 ubiquity generator framework: 7 years of progress in parallelizing branch-and-bound
• Thinning out Steiner trees: a node-based model for uniform edge costs
• Computational Integer Programming and Cutting Planes
• A layered graph model and an adaptive layers framework to solve delay-constrained minimum tree problems
• 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
• Steiner tree packing revisited
• 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
• 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
• Stronger MIP formulations for the Steiner forest problem
• A note on the practicality of maximal planar subgraph algorithms
• Chvátal-Gomory cuts for the Steiner tree problem
• Exact algorithms for the maximum planar subgraph problem: new models and experiments
• Combining NP-hard reduction techniques and strong heuristics in an exact algorithm for the maximum-weight connected subgraph 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
• Mathematical methods for physical layout of printed circuit boards: an overview

This page was built for software: SteinLib