Steiner problem in networks: A survey
From MaRDI portal
Publication:3790913
DOI10.1002/net.3230170203zbMath0646.90028OpenAlexW2172222998WikidataQ126263634 ScholiaQ126263634MaRDI QIDQ3790913
Publication date: 1987
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230170203
surveyheuristicsLagrangean relaxationweighted graphSteiner problem in networksdual ascentexact algorithmsprobabilistic networksminimum cost connected network
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Stochastic network models in operations research (90B15) Deterministic network models in operations research (90B10) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39) Boolean programming (90C09) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (only showing first 100 items - show all)
Preprocessing Steiner problems from VLSI layout ⋮ The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets ⋮ Applying a result of Frankl and Rödl to the construction of Steiner trees in the hypercube ⋮ An 11/6-approximation algorithm for the network Steiner problem ⋮ Steiner distance stable graphs ⋮ The computational complexity of the reliability problem on distributed systems ⋮ On-line generalized Steiner problem ⋮ Steiner problem in Halin networks ⋮ On the Steiner ratio in 3-space ⋮ Greedy algorithms for the on-line steiner tree and generalized steiner problems ⋮ A survey of combinatorial optimization problems in multicast routing ⋮ Distributed multicast routing in point-to-point networks ⋮ Finding Totally Independent Spanning Trees with Linear Integer Programming ⋮ Worst-case performance of Rayward-Smith's Steiner tree heuristic ⋮ New primal-dual algorithms for Steiner tree problems ⋮ An edge elimination test for the Steiner problem in graphs ⋮ A heuristic for the Steiner problem in graphs ⋮ The Steiner problem with edge lengths 1 and 2 ⋮ On the Steiner median of a tree ⋮ A factoring approach for the Steiner tree problem in undirected networks ⋮ A constrained Steiner tree problem ⋮ General network design: a unified view of combined location and network design problems ⋮ A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees ⋮ The Performance of greedy algorithms for the on-line steiner tree and related problems ⋮ Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic ⋮ An integer programming formulation of the Steiner problem in graphs ⋮ A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints ⋮ A metaheuristic for security budget allocation in utility networks ⋮ Analysis and computational study of several integer programming formulations for minimum-energy multicasting in wireless ad hoc networks ⋮ Tree network design avoiding congestion ⋮ Spanners and message distribution in networks. ⋮ Wiretapping Based on Node Corruption over Secure Network Coding: Analysis and Optimization ⋮ MULTICASTING AND BROADCASTING IN UNDIRECTED WDM NETWORKS AND QoS EXTENTIONS OF MULTICASTING ⋮ Unnamed Item ⋮ Branch-and-cut-and-price for capacitated connected facility location ⋮ Polynomially solvable special cases of the Steiner problem in planar networks ⋮ An approach for the Steiner problem in directed graphs ⋮ Minimal length tree networks on the unit sphere ⋮ The role of Steiner hulls in the solution to Steiner tree problems ⋮ On graphs preserving rectilinear shortest paths in the presence of obstacles ⋮ Steiner minimal trees for three points with one convex polygonal obstacle ⋮ Facets of two Steiner arborescence polyhedra ⋮ An integrated approach to routing and via minimization ⋮ A Lagrangean-based decomposition approach for the link constrained Steiner tree problem ⋮ Two new criteria for finding Steiner hulls in Steiner tree problems ⋮ Path-distance heuristic for the Steiner problem in undirected networks ⋮ Linear bounds for on-line Steiner problems ⋮ A hybrid optimization approach for the Steiner \(k\)-connected network design problem ⋮ Steiner diagrams and \(k\)-star hubs ⋮ Binary Steiner trees: structural results and an exact solution approach ⋮ Concurrent multicast in weighted networks ⋮ Steiner trees with \(n\) terminals among \(n+1\) nodes ⋮ On-line Steiner trees in the Euclidean plane ⋮ Heuristics for the Steiner problem in graphs ⋮ Viral systems: A new bio-inspired optimisation approach ⋮ THE EFFECT OF ASYMMETRY ON THE ON-LINE MULTICAST ROUTING PROBLEM ⋮ Survivable networks, linear programming relaxations and the parsimonious property ⋮ Steiner's problem in graphs: Heuristic methods ⋮ Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem ⋮ Worst-case performance of Wong's Steiner tree heuristic ⋮ Concurrent multicast in weighted networks ⋮ Variable neighbourhood search for the minimum labelling Steiner tree problem ⋮ Two variations of the minimum Steiner problem ⋮ A note on distributed multicast routing in point-to-point networks ⋮ Steiner trees and polyhedra ⋮ Using structured steiner trees for hierarchical global routing ⋮ A branch-and-price algorithm for the Steiner tree packing problem. ⋮ Effective multicasting algorithm for dynamic membership with delay constraint ⋮ Heuristic algorithms for packing of multiple-group multicasting ⋮ Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in \(E^ 3\) ⋮ Minimization of multicast traffic and ensuring its fault tolerance in software-defined networks ⋮ Some concepts of stability analysis in combinatorial optimization ⋮ Generalized network design problems. ⋮ Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) ⋮ Topological indices based on 2- or 3-eccentricity to predict anti-HIV activity ⋮ Analyse de sensibilité pour les problèmes linéaires en variables 0-1 ⋮ Combinatorial optimization in system configuration design ⋮ Multi-level Steiner Trees ⋮ Constrained Steiner trees in Halin graphs ⋮ A formulation for a hop constrained survivable network design problem ⋮ Rectilinear paths among rectilinear obstacles ⋮ Generalized spanning trees ⋮ Strong Formulations for 2-Node-Connected Steiner Network Problems ⋮ Digital data networks design using genetic algorithms ⋮ Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions ⋮ Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study ⋮ The Steiner problem in distributed computing systems ⋮ A deep-submicron Steiner tree. ⋮ A fast search algorithm for the quorumcast routing problem. ⋮ Worst-case performance of some heuristics for Steiner's problem in directed graphs ⋮ Steiner's problem in double trees ⋮ Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming ⋮ Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs ⋮ A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs ⋮ Multi-Level Steiner Trees. ⋮ A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space ⋮ Uncapacitated point-to-multipoint network flow problem and its application to multicasting in telecommunication networks ⋮ A neural network for the Steiner minimal tree problem ⋮ Non delayed relax-and-cut algorithms ⋮ Lagrangian relaxation for maximum service in multicast routing with QoS constraints
Cites Work
This page was built for publication: Steiner problem in networks: A survey
