Polyhedral results and stronger Lagrangean bounds for stable spanning trees

Phillippe Samer, Dag Haugland

Given a graph $G=(V,E)$ and a set $C$ of unordered pairs of edges regarded as being in conflict, a stable spanning tree in $G$ is a set of edges $T$ inducing a spanning tree in $G$…