666 search results - page 40 / 134 » The Pipelined Set Cover Problem |
MOR
2002
13 years 9 months ago
2002
We present a polyhedral study of the complementarity knapsack problem. Traditionally, complementarity constraints are modeled by introducing auxiliary binary variables and additio...
INFOCOM
2007
IEEE
14 years 4 months ago
2007
IEEE
— Unlike convectional omni-directional sensors that always have an omni-angle of sensing range, directional sensors may have a limited angle of sensing range due to technical con...
ALGORITHMICA
2008
13 years 10 months ago
2008
We present exact algorithms with exponential running times for variants of n-element set cover problems, based on divide-and-conquer and on inclusion
COCOON
2005
Springer
14 years 3 months ago
2005
Springer
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...
EAAI
2006
13 years 10 months ago
2006
This paper presents a feasibility study of evolutionary scheduling for gas pipeline operations. The problem is complex because of several constraints that must be taken into consi...