Coverage is a fundamental problem in heterogeneous wireless sensor networks (HWSNs). Lifetime of the HWSNs is another important problem in this area. The K-Cover problem can solve both the coverage ...

0-1 knapsack problem is a typical NP complex issues in field of computer. Traditional solve knapsack problem is recursively backtracking and greedy methods. Use recursive backtracking to solve ...