4903 search results - page 43 / 981 » The Set Covering Machine |
CCCG
2008
13 years 10 months ago
2008
Let P be the point set in two dimensional plane. In this paper, we consider the problem of locating two isothetic unit squares such that together they cover maximum number of poin...
ORL
2011
13 years 4 months ago
2011
Computing the 1-width of the incidence matrix of a Steiner Triple System gives rise to small set covering instances that provide a computational challenge for integer programming ...
GECCO
2007
Springer
14 years 3 months ago
2007
Springer
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
SWAT
2004
Springer
14 years 2 months ago
2004
Springer
The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...
IPCO
2007
13 years 10 months ago
2007
Let A be the edge-node incidence matrix of a bipartite graph G = (U, V ; E), I be a subset the nodes of G, and b be a vector such that 2b is integral. We consider the following mi...