• 沒有找到結果。

A Fast Mixed Integer Programming Formulation for the Maximum Set Covers Problem in Wireless Sensor Networks

N/A
N/A
Protected

Academic year: 2021

Share "A Fast Mixed Integer Programming Formulation for the Maximum Set Covers Problem in Wireless Sensor Networks"

Copied!
7
0
0

加載中.... (立即查看全文)

全文

Loading

數據

Figure 2. A group of possible cover sets for the  MSC problem in Figure 1.
Figure 1 is  . Sj 3 1.5t= 1, 2,3j=Siti 0.512t+ +t
Figure 4. An example to illustrate our new  inequality (9). can be rewritten as  ps jMt1 T c=j≤∑≤
Table 1. The execution times of different MIPFs ith WSNETs including single-sensor cover sets

參考文獻

相關文件

More precisely, it is the problem of partitioning a positive integer m into n positive integers such that any of the numbers is less than the sum of the remaining n − 1

Write the following problem on the board: “What is the area of the largest rectangle that can be inscribed in a circle of radius 4?” Have one half of the class try to solve this

Primal-dual approach for the mixed domination problem in trees Although we have presented Algorithm 3 for finding a minimum mixed dominating set in a tree, it is still desire to

11 (1998) 227–251] for the nonnegative orthant complementarity problem to the general symmet- ric cone complementarity problem (SCCP). We show that the class of merit functions

Given a connected graph G together with a coloring f from the edge set of G to a set of colors, where adjacent edges may be colored the same, a u-v path P in G is said to be a

* All rights reserved, Tei-Wei Kuo, National Taiwan University, 2005..

The well-known halting problem (a decision problem), which is to determine whether or not an algorithm will terminate with a given input, is NP-hard, but

Given a graph and a set of p sources, the problem of finding the minimum routing cost spanning tree (MRCT) is NP-hard for any constant p > 1 [9].. When p = 1, i.e., there is only