Abstract | ||
---|---|---|
In this paper, we introduce a new optimization problem, the Minimum Cost Hop-and-root Constrained Forest Problem, which arises in the design of energy efficient Wireless Sensor Networks. An Integer Program, a heuristic solution approach and computational experiments with the proposed models and algorithms are presented. |
Year | DOI | Venue |
---|---|---|
2009 | 10.1016/j.endm.2009.11.024 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
Combinatorial optimization,Hop-constrained trees,Network flows,Heuristics | Integer,Heuristic,Mathematical optimization,Computer science,Efficient energy use,Hop (networking),Optimization problem,Wireless sensor network,Constrained optimization | Journal |
Volume | ISSN | Citations |
35 | 1571-0653 | 3 |
PageRank | References | Authors |
0.49 | 1 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Carla Bechelane | 1 | 3 | 0.49 |
Alexandre Salles da Cunha | 2 | 242 | 22.32 |
Geraldo R. Mateus | 3 | 134 | 13.00 |