An algorithm for the steiner problem in graphs
From MaRDI portal
Publication:5896365
DOI10.1002/net.3230140112zbMath0541.90034OpenAlexW2008771115MaRDI QIDQ5896365
Publication date: 1984
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230140112
Lagrangian relaxationSteiner problemlogisticsComputational teststree search procedurelocation on graphslower bounds on the minimum cost
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05) Boolean programming (90C09)
Related Items
Preprocessing Steiner problems from VLSI layout, The telephonic switching centre network problem: Formalization and computational experience, Node-weighted Steiner tree approximation in unit disk graphs, An edge elimination test for the Steiner problem in graphs, Fast heuristic algorithms for rectilinear Steiner trees, On reductions for the Steiner problem in graphs, A factoring approach for the Steiner tree problem in undirected networks, A constrained Steiner tree problem, A probably fast, provably optimal algorithm for rectilinear Steiner trees, Approximation algorithms for Steiner forest: An experimental study, An integer programming formulation of the Steiner problem in graphs, Solving Steiner trees: Recent advances, challenges, and perspectives, Optimizing the Design of a Wind Farm Collection Network, Vertex covering with capacitated trees, Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm, SCIP-Jack -- a solver for STP and variants with parallelization extensions, Tree network design avoiding congestion, Finding minimum cost directed trees with demands and capacities, The multi-weighted Steiner tree problem, An approach for the Steiner problem in directed graphs, The role of Steiner hulls in the solution to Steiner tree problems, Path-distance heuristic for the Steiner problem in undirected networks, Reduction tests for the prize-collecting Steiner problem, Steiner's problem in graphs: Heuristic methods, A faster approximation algorithm for the Steiner problem in graphs, A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem, Dynamic programming for spanning tree problems: application to the multi-objective case, Improved algorithms for the Steiner problem in networks, Heuristic algorithms for packing of multiple-group multicasting, A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs, Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs, Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions
Cites Work
