A branch-and-cut algorithm for two-level survivable network design problems. Martín, I. R., González, J. J. S., & Yaman, H. Computers & OR, 67:102-112, 2016.
A branch-and-cut algorithm for two-level survivable network design problems. [link]Link  A branch-and-cut algorithm for two-level survivable network design problems. [link]Paper  bibtex   
@article{journals/cor/MartinGY16,
  added-at = {2016-01-04T00:00:00.000+0100},
  author = {Martín, Inmaculada Rodríguez and González, Juan José Salazar and Yaman, Hande},
  biburl = {http://www.bibsonomy.org/bibtex/258c0b815e778e8f86ebfe3726f9830d4/dblp},
  ee = {http://dx.doi.org/10.1016/j.cor.2015.09.008},
  interhash = {f9eada6391e5da25625cd7d5a3d0faaf},
  intrahash = {58c0b815e778e8f86ebfe3726f9830d4},
  journal = {Computers & OR},
  keywords = {dblp},
  pages = {102-112},
  timestamp = {2016-01-05T11:39:26.000+0100},
  title = {A branch-and-cut algorithm for two-level survivable network design problems.},
  url = {http://dblp.uni-trier.de/db/journals/cor/cor67.html#MartinGY16},
  volume = 67,
  year = 2016
}
Downloads: 0