16404 search results - page 356 / 3281 » A set coverage problem |
194
click to vote
WADS
2007
Springer
16 years 1 months ago
2007
Springer
Connectivity augmentation problems ask for adding a set of at most k edges whose insertion makes a given graph satisfy a specified connectivity property, such as bridge-connectivi...
188
click to vote
CSDA
2007
15 years 7 months ago
2007
Of interest here are linear data fitting problems with uncertain data which lie in a given uncertainty set. A robust counterpart of such a problem may be interpreted as the probl...
194
click to vote
ICPR
2000
IEEE
16 years 8 months ago
2000
IEEE
We studied a number of measures that characterize the difficulty of a classification problem. We compared a set of real world problems to random combinations of points in this mea...
210
click to vote
COCOA
2007
Springer
16 years 1 months ago
2007
Springer
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...
184
click to vote
EOR
2007
15 years 7 months ago
2007
Abstract. Given an optimization problem with a composite of a convex and componentwise increasing function with a convex vector function as objective function, by means of the conj...