A branch and cut algorithm for minimum spanning trees under conflict constraints

Phillippe Samer, Sebastián Urrutia. A branch and cut algorithm for minimum spanning trees under conflict constraints. Optimization Letters, 9(1):41-55, 2015. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.