1566 search results - page 95 / 314 » On a Cone Covering Problem |
128
click to vote
COR
2006
15 years 6 months ago
2006
This paper is concerned with extending models for the maximal covering location problem in two ways. First, the usual 0
150
click to vote
ECCC
2006
15 years 6 months ago
2006
In our problem we are given a set of customers, their positions on the plane and their demands. Geometrically, the area covered by a directional antenna with parameters , ,
153
click to vote
ALGOSENSORS
2006
Springer
15 years 10 months ago
2006
Springer
: We consider the broadcasting problem in sensor networks where the nodes have no prior knowledge of their neighbourhood. We describe several Area-based Beaconless Broadcasting Alg...
167
click to vote
CCGRID
2003
IEEE
15 years 11 months ago
2003
IEEE
Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with...
152
click to vote
IPCO
2001
15 years 7 months ago
2001
The paper presents a branch-and-cut for solving (0, 1) integer linear programs having a large symmetry group. The group is used for pruning the enumeration tree and for generating ...