Take Action

Home | Faculty & Research Overview | Research

Research Details

Solving a Steiner Tree Problem on a Graph Using Branch and Cut, ORSA Journal on Computing

Abstract

In this paper we report computational experience with a branch and cut solver for the Steimer tree problem on a graph. The problem instances include complete graphs, randomly generated sparse graphs and grid graphs. The edge weights are either randomly generated or are the Euclidean distance between the endnodes that are placed at random on the plane. The effect of changing various problem parameters on solution time is studied.

Type

Article

Author(s)

Sunil Chopra, Edgar R. Gorres, M. R. Rao

Date Published

1992

Citations

Chopra, Sunil, Edgar R. Gorres, and M. R. Rao. 1992. Solving a Steiner Tree Problem on a Graph Using Branch and Cut. ORSA Journal on Computing. 4(3): 320-335.

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