THE STEINER TREE PROBLEM .2. PROPERTIES AND CLASSES OF FACETS

Authors
CHOPRA S RAO MR
Citation
S. Chopra et Mr. Rao, THE STEINER TREE PROBLEM .2. PROPERTIES AND CLASSES OF FACETS, Mathematical programming, 64(2), 1994, pp. 231-246
Citations number
7
Categorie Soggetti
Operatione Research & Management Science",Mathematics,"Operatione Research & Management Science",Mathematics,"Computer Science Software Graphycs Programming
Journal title
Mathematical programming → ACNP
ISSN journal
00255610
Volume
64
Issue
2
Year of publication
1994
Pages
231 - 246
Database
ISI
SICI code
0025-5610(1994)64:2<231:TSTP.P>2.0.ZU;2-I
Abstract
This is the second part of two papers addressing the study of the faci al structure of the Steiner tree polyhedron. In this paper we identify several classes of facet defining inequalities and relate them to spe cial classes of graphs on which the Steiner tree problem is known to b e NP-hard.