Optimal connected subgraphs: Integer programming formulations and polyhedra
Sign Up to like & getrecommendations! Published in 2022 at "Networks"
DOI: 10.1002/net.22101
Abstract: Connectivity is a central concept in combinatorial optimization, graph theory, and operations research. In many applications, one is interested in finding an optimal subset of vertices with the essential requirement that the vertices are connected,… read more here.
Keywords: integer; programming formulations; connected subgraphs; optimal connected ... See more keywords
Integer programming formulations for the shared multicast tree problem
Sign Up to like & getrecommendations! Published in 2019 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-019-00428-8
Abstract: AbstractWe study the shared multicast tree (SMT) problem in wireless networks. To support a multicast session between a set of network nodes, SMT aims to establish a wireless connection between them, such that the total… read more here.
Keywords: programming formulations; problem; tree problem; integer programming ... See more keywords