Optimizing sensor cover energy via DC programming
From MaRDI portal
Recommendations
- Monotonic optimization for sensor cover energy problem
- Solving the sensor cover energy problem via integer linear programming.
- Energy-constrained geometric coverage problem
- A Lagrangean-based heuristics for the target covering problem in wireless sensor network
- Sensor networks and covering of plane by discs
Cites work
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Exact and heuristic methods to maximize network lifetime in wireless sensor networks with adjustable sensing ranges
- scientific article; zbMATH DE number 1978128 (Why is no real title available?)
- Maximizing system lifetime in wireless sensor networks
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- Non-Linear Programming Via Penalty Functions
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
Cited in
(11)- Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints
- Monotonic optimization for sensor cover energy problem
- Classification in the multiple instance learning framework via spherical separation
- Sequential difference-of-convex programming
- Proximal bundle methods for nonsmooth DC programming
- Solving the sensor cover energy problem via integer linear programming.
- Approximation by delta-convex mappings in certain spaces
- Essentials of numerical nonsmooth optimization
- Preface to the special issue ``Recent developments in non-linear and global optimization
- Essentials of numerical nonsmooth optimization
- A Lagrangean relaxation approach to lifetime maximization of directional sensor networks
This page was built for publication: Optimizing sensor cover energy via DC programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963236)
