A branch and cut algorithm for the capacitated star–star telecommunication network problem
Sign Up to like & getrecommendations! Published in 2019 at "Optimization Letters"
DOI: 10.1007/s11590-018-1282-6
Abstract: In this study, a branch and cut algorithm is generated for a telecommunication network problem with bi-hierarchical star–star design and fixed identical concentrator capacities. The problem aims to find out how many and on which… read more here.
Keywords: telecommunication network; problem; cut algorithm; network problem ... See more keywords