16596 search results - page 401 / 3320 » Generalized Assignment Problems |
169
Voted
EOR
2006
15 years 7 months ago
2006
This paper studies the duality gap in the simple plant location problem, and presents general formulas for the gap when certain complementary slackness conditions are satisfied. W...
177
click to vote
MP
2006
15 years 7 months ago
2006
Although the general linear complementarity problem (LCP) is NP-complete, there are special classes that can be solved in polynomial time. One example is the type where the definin...
162
Voted
MOC
2002
15 years 7 months ago
2002
The multigrid V -cycle algorithm using the Richardson relaxation scheme as the smoother is studied in this paper. For second-order elliptic boundary value problems, the contraction...
214
Voted
SIAMJO
2010
15 years 2 months ago
2010
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the r...
170
click to vote
COCOA
2008
Springer
15 years 9 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...