A branch and cut algorithm for the capacitated star–star telecommunication network problem
Crossref DOI link: https://doi.org/10.1007/s11590-018-1282-6
Published Online: 2018-06-11
Published Print: 2019-06
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Güden, Hüseyin
Yakıcı, Ertan http://orcid.org/0000-0002-8148-1031
Text and Data Mining valid from 2018-06-11
Article History
Received: 9 February 2017
Accepted: 5 June 2018
First Online: 11 June 2018