Pages that link to "Item:Q2815458"
From MaRDI portal
The following pages link to A branch-and-cut approach for the minimum-energy broadcasting problem in wireless networks (Q2815458):
Displaying 12 items.
- A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks (Q323507) (← links)
- Distributed ant colony optimization for minimum energy broadcasting in sensor networks with realistic antennas (Q356391) (← links)
- A linear programming-based evolutionary algorithm for the minimum power broadcast problem in wireless sensor networks (Q662130) (← links)
- Optimal solutions to minimum total energy broadcasting problem in wireless ad hoc networks (Q857761) (← links)
- A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks (Q1935910) (← links)
- An exact approach for the minimum-cost bounded-error calibration tree problem (Q2178300) (← links)
- An integer programming formulation of the key management problem in wireless sensor networks (Q2191280) (← links)
- A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networks (Q2267666) (← links)
- Mixed integer formulations for the probabilistic minimum energy broadcast problem in wireless networks (Q2427201) (← links)
- Improved approximation results for the minimum energy broadcasting problem (Q2471706) (← links)
- The minimum cost hop-and-root constrained forest in wireless sensor networks (Q2840531) (← links)
- Lower and upper bounds for minimum energy broadcast and sensing problems in sensor networks† (Q3437345) (← links)
