Steiner trees and polyhedra (Q5946818): Difference between revisions

The authors introduce a new class of valid inequalities of the Steiner tree polytope (STP) and give sufficient conditions for these inequalities to define facets. They present a counterexample to a conjecture of \textit{S. Chopra} and \textit{M. R. Rao} [Math. Programming 64, 209-229 and 231-246 (1994; Zbl 0821.90124 and Zbl 0831.90115)] and describe the dominant of the STP and the Steiner connected subgraph polytope on special classes of graphs (in particular, series--parallel graphs).