In this paper we consider the Steiner problem in graphs. This is the problem of connecting together, at minimum cost, a number of vertices in an undirected graph. We present two lower bounds for the problem, these bounds being based on two separate Lagrangian relaxations of a zero‐one integer programming formulation of the problem. Problem reduction tests derived from both the original problem and the Lagrangian relaxations are given. Incorporating the bounds and the reduction tests into a tree search procedure enables us to solve problems involving the connection of up to 50 vertices in a graph with 200 undirected arcs and 100 vertices. Copyright © 1984 Wiley Periodicals, Inc., A Wiley Company
CITATION STYLE
Beasley, J. E. (1984). An algorithm for the steiner problem in graphs. Networks, 14(1), 147–159. https://doi.org/10.1002/net.3230140112
Mendeley helps you to discover research relevant for your work.