In this paper we give some integer programming formulations for the Steiner tree problem on undirected and directed graphs and study the associated polyhedra. We give some families of facets for the undirected case along with some compositions and extensions. We also give a projection that relates the Steiner tree polyhedron on an undirected graph to the polyhedron for the corresponding directed graph. This is used to show that the LP-relaxation of the directed formulation is superior to the LP-relaxation of the undirected one.
|Original language||English (US)|
|Number of pages||21|
|Journal||Mathematical Programming, Series B|
|State||Published - Jan 1 1994|
ASJC Scopus subject areas