Name
Abstract | ||
|---|---|---|
•We address an optimization problem arising in the design of ad-hoc wireless sensor networks. The so called p-arborescence star problem (P-ASP).•We introduce MIP formulations and exact solution methods for P-ASP.•Valid inequalities to strengthen the models are also given.•We develop three branch-and-cut algorithms and a combinatorial Benders-based heuristic, which is used to provide the initial solution to exact algorithms.•Optimal solutions obtained with the proposed branch-and-cut algorithms are reported for instances with at most 200 vertices and 60 cluster-heads. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.cor.2018.10.004 | Computers & Operations Research |
Keywords | Field | DocType |
Wireless sensor networks,Arborescence,Cutting-plane method | Exact solutions in general relativity,Mathematical optimization,Disjoint sets,Arborescence,Cluster analysis,Multi-commodity flow problem,Wireless sensor network,Sink (computing),Digraph,Mathematics | Journal |
Volume | ISSN | Citations |
102 | 0305-0548 | 0 |
PageRank | References | Authors |
0.34 | 25 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vinicius W. C. Morais | 1 | 39 | 2.33 |
| Bernard Gendron | 2 | 688 | 49.92 |
| Geraldo Robson Mateus | 3 | 413 | 42.30 |