The recoverable robust spanning tree problem with interval costs is polynomially solvable
Crossref DOI link: https://doi.org/10.1007/s11590-016-1057-x
Published Online: 2016-07-04
Published Print: 2017-01
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Hradovich, Mikita
Kasperski, Adam
Zieliński, Paweł
Funding for this research was provided by:
Narodowe Centrum Nauki (2013/09/B/ST6/01525, 2013/09/B/ST6/01525)
Politechnika Wroclawska (S50129/K1102)
License valid from 2016-07-04