16404 search results - page 481 / 3281 » A set coverage problem |
149
click to vote
CCCG
1993
15 years 8 months ago
1993
Given three angles summing to 2, given n points in the plane and a tripartition k1 + k2 + k3 = n, we can tripartition the plane into three wedges of the given angles so that the ...
160
click to vote
ALENEX
2009
15 years 8 months ago
2009
In this paper we present an experimental study of several maximum flow algorithms in the context of unbalanced bipartite networks. Our experiments are motivated by a real world pr...
153
click to vote
COR
2008
15 years 7 months ago
2008
In this paper, an improved Two-Stage Simulated Annealing algorithm is presented for the Minimum Linear Arrangement Problem for Graphs. This algorithm integrates several distinguis...
185
click to vote
COR
2006
15 years 6 months ago
2006
We develop a simple and practical exact algorithm for the problem of locating p facilities and assigning clients7 to them within capacity restrictions in order to minimize the max...
154
click to vote
EOR
2006
15 years 6 months ago
2006
In this paper, we provide a heuristic procedure, that performs well from a global optimality point of view, for an important and difficult class of bilevel programs. The algorithm...