Publication:3760270
From MaRDI portal
zbMath0622.90029MaRDI QIDQ3760270
Publication date: 1987
survey; branch-and-bound; undirected graph; Lagrangean relaxations; facility location on graphs; Steiner Problem
05C05: Trees
65K05: Numerical mathematical programming methods
90C10: Integer programming
90B05: Inventory, storage, reservoirs
Related Items
Preprocessing Steiner problems from VLSI layout, The Performance of greedy algorithms for the on-line steiner tree and related problems, A comparison of Steiner tree relaxations, Linear bounds for on-line Steiner problems, Survivable networks, linear programming relaxations and the parsimonious property, Non delayed relax-and-cut algorithms, An edge elimination test for the Steiner problem in graphs, A constrained Steiner tree problem, An approach for the Steiner problem in directed graphs, Facets of two Steiner arborescence polyhedra, Steiner trees with \(n\) terminals among \(n+1\) nodes, Class Steiner trees and VLSI-design, Algorithms for a multi-level network optimization problem, Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study, Clustering heuristics for set covering, Directed Steiner problems with connectivity constraints, Worst-case performance of Wong's Steiner tree heuristic