Document is current

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

Crossref DOI link: https://doi.org/10.1007/s11590-014-0750-x

Published Online: 2014-05-30

Published Print: 2015-01

Update policy: https://doi.org/10.1007/springer_crossmark_policy