Pages that link to "Item:Q2840531"
From MaRDI portal
The following pages link to The minimum cost hop-and-root constrained forest in wireless sensor networks (Q2840531):
Displaying 7 items.
- Strong minimum energy \(2\)-hop rooted topology for hierarchical wireless sensor networks (Q887852) (← links)
- The \(p\)-arborescence star problem: formulations and exact solution approaches (Q1628121) (← links)
- Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem (Q1651640) (← links)
- Heuristic approaches for the optimal wiring in large scale robotic skin design (Q1761221) (← links)
- An exact approach for the minimum-cost bounded-error calibration tree problem (Q2178300) (← links)
- Using VNS for the optimal synthesis of the communication tree in wireless sensor networks (Q2631223) (← links)
- Stronger column generation bounds for the minimum cost hop-and-root constrained forest problem (Q2840729) (← links)