Elder M. Macambira

Learn More
Let Kn ˆ …V ;E† be the complete undirected graph with weights ce associated to the edges in E. We consider the problem of ®nding the subclique C ˆ …U ; F † of Kn such that the sum of the weights of the edges in F is maximized and jU j6 b, for some b 2 ‰1; . . . ; nŠ. This problem is called the Maximum Edge-Weighted Clique Problem (MEWCP) and is NP-hard. In(More)
In this paper, we consider a combinatorial optimization problem that arises in telecommunications networks design. It is known as the SONET ring assignment problem (SRAP). In this problem, each client site has to be assigned to exactly one SONET ring and a special ring interconnects the other rings together. The problem is to find a feasible assignment of(More)
We consider the problem of interconnecting a set of customer sites using SONET rings of equal capacity, which can be defined as follows: Given an undirected graph G = (V,E) with nonnegative edge weight duv, (u,v) ∈ E , and two integers k and B, find a partition of the nodes of G into k subsets so that the total weight of the edges connecting the nodes in(More)
In this paper we consider the SONET ring assignment problem (SRAP) presented by Goldschmidt et al. in [9]. The authors pointed out to the inadequacy of solving SRAP instances using their integer programming formulation and commercial linear programming solvers. Similar experiences with IP models for SRAP are reported in [1]. In this paper we presented some(More)
  • 1