A branch-and-cut algorithm for the maximum covering cycle problem
Sign Up to like & getrecommendations! Published in 2020 at "Annals of Operations Research"
DOI: 10.1007/s10479-018-2856-5
Abstract: In many applications, such as telecommunications and routing, we seek for cost-effective infrastructure or operating layouts so that many nodes (e.g., customers) of a support network (typically modeled by a graph) are covered by, or… read more here.
Keywords: cycle; covering cycle; maximum covering; cycle problem ... See more keywords