—In this paper, we formulate an optimization problem for the design of light-tree based logical topology in Wavelength Division Multiplexing (WDM) networks. The problem is compri...
We study here the gossiping problem (all-to-all communication) in known radio networks, i.e., when all nodes are aware of the network topology. We start our presentation with a det...
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
H. Edwin Romeijn, Dushyant Sharma, Robert L. Smith
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
Yuri Frota, Nelson Maculan, Thiago F. Noronha, Cel...
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...