A branch-and-cut algorithm for two-level survivable network design problems. Martín, I. R., González, J. J. S., & Yaman, H. Comput. Oper. Res., 67:102–112, 2016.
Paper doi bibtex @article{DBLP:journals/cor/MartinGY16,
author = {Inmaculada Rodr{\'{\i}}guez Mart{\'{\i}}n and
Juan Jos{\'{e}} Salazar Gonz{\'{a}}lez and
Hande Yaman},
title = {A branch-and-cut algorithm for two-level survivable network design
problems},
journal = {Comput. Oper. Res.},
volume = {67},
pages = {102--112},
year = {2016},
url = {https://doi.org/10.1016/j.cor.2015.09.008},
doi = {10.1016/J.COR.2015.09.008},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cor/MartinGY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
Downloads: 0
{"_id":"NJMmsePnJzujDWxBW","bibbaseid":"martn-gonzlez-yaman-abranchandcutalgorithmfortwolevelsurvivablenetworkdesignproblems-2016","downloads":0,"creationDate":"2016-02-15T15:10:33.679Z","title":"A branch-and-cut algorithm for two-level survivable network design problems","author_short":["Martín, I. R.","González, J. J. S.","Yaman, H."],"year":2016,"bibtype":"article","biburl":"https://dblp.org/pid/59/6533.bib","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Inmaculada","Rodríguez"],"propositions":[],"lastnames":["Martín"],"suffixes":[]},{"firstnames":["Juan","José","Salazar"],"propositions":[],"lastnames":["González"],"suffixes":[]},{"firstnames":["Hande"],"propositions":[],"lastnames":["Yaman"],"suffixes":[]}],"title":"A branch-and-cut algorithm for two-level survivable network design problems","journal":"Comput. Oper. Res.","volume":"67","pages":"102–112","year":"2016","url":"https://doi.org/10.1016/j.cor.2015.09.008","doi":"10.1016/J.COR.2015.09.008","timestamp":"Sat, 09 Apr 2022 01:00:00 +0200","biburl":"https://dblp.org/rec/journals/cor/MartinGY16.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/cor/MartinGY16,\n author = {Inmaculada Rodr{\\'{\\i}}guez Mart{\\'{\\i}}n and\n Juan Jos{\\'{e}} Salazar Gonz{\\'{a}}lez and\n Hande Yaman},\n title = {A branch-and-cut algorithm for two-level survivable network design\n problems},\n journal = {Comput. Oper. Res.},\n volume = {67},\n pages = {102--112},\n year = {2016},\n url = {https://doi.org/10.1016/j.cor.2015.09.008},\n doi = {10.1016/J.COR.2015.09.008},\n timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/cor/MartinGY16.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Martín, I. R.","González, J. J. S.","Yaman, H."],"key":"DBLP:journals/cor/MartinGY16","id":"DBLP:journals/cor/MartinGY16","bibbaseid":"martn-gonzlez-yaman-abranchandcutalgorithmfortwolevelsurvivablenetworkdesignproblems-2016","role":"author","urls":{"Paper":"https://doi.org/10.1016/j.cor.2015.09.008"},"metadata":{"authorlinks":{}},"downloads":0,"html":""},"search_terms":["branch","cut","algorithm","two","level","survivable","network","design","problems","martín","gonzález","yaman"],"keywords":[],"authorIDs":[],"dataSources":["4EyiD7ZkZehbHrzbX","jGbjhtCsjY4SsWBpZ"]}