Frederico Paiva Quintão

Learn More
The recent area of Wireless Sensor Networks (WSNs) has brought new challenges to developers of network protocols. One of these challenges consists of maintaining the coverage of the monitoring area and the connectivity between the network nodes, preferably accomplishing the management of the network resources. This problem can be modeled as a Mathematical(More)
In this paper, we present two Integer Programming formulations for the k-Cardinality Tree Problem. The first is a multiflow formulation while the second uses a lifting of the Miller-Tucker-Zemlin constraints. Based on our computational experience, we suggest a two-phase exact solution approach that combines two different solution techniques, each one(More)
  • 1