Take Action

Home | Faculty & Research Overview | Research

Research Details

The Steiner Tree problem I: Formulations, Compositions and Extensions of Facets, Mathematical Programming

Abstract

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.

Type

Article

Author(s)

Sunil Chopra, M. R. Rao

Date Published

1994

Citations

Chopra, Sunil, and M. R. Rao. 1994. The Steiner Tree problem I: Formulations, Compositions and Extensions of Facets. Mathematical Programming. 64(1-3): 209-229.

KELLOGG INSIGHT

Explore leading research and ideas

Find articles, podcast episodes, and videos that spark ideas in lifelong learners, and inspire those looking to advance in their careers.
learn more

COURSE CATALOG

Review Courses & Schedules

Access information about specific courses and their schedules by viewing the interactive course scheduler tool.
LEARN MORE

DEGREE PROGRAMS

Discover the path to your goals

Whether you choose our Full-Time, Part-Time or Executive MBA program, you’ll enjoy the same unparalleled education, exceptional faculty and distinctive culture.
learn more

Take Action