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]

@article{SamerU15,
  title = {A branch and cut algorithm for minimum spanning trees under conflict constraints},
  author = {Phillippe Samer and Sebastián Urrutia},
  year = {2015},
  doi = {10.1007/s11590-014-0750-x},
  url = {http://dx.doi.org/10.1007/s11590-014-0750-x},
  researchr = {https://researchr.org/publication/SamerU15},
  cites = {0},
  citedby = {0},
  journal = {Optimization Letters},
  volume = {9},
  number = {1},
  pages = {41-55},
}