Take Action
Home | Faculty & Research Overview | Research
Research Details
The Steiner Tree Problem II: Properties and Classes of Facets, Mathematical Programming
Abstract
This is the second part of two papers addressing the study of the facial structure of the Steiner tree polyhedron. In this paper we identify several classes of facet defining inequalities and relate them to special classes of graphs on which the Steiner tree problem is known to be NP-hard.
Type
Article
Author(s)
Date Published
1994
Citations
. 1994. The Steiner Tree Problem II: Properties and Classes of Facets. Mathematical Programming.(1-3): 231-246.
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