13376 search results - page 222 / 2676 » Problem Solving with |
107
click to vote
DISOPT
2007
15 years 3 months ago
2007
The job rotation problem (JRP) is the following: Given an n × n matrix A over R ∪ {−∞} and k ≤ n, find a k × k principal submatrix of A whose optimal assignment problem...
136
Voted
SIAMJO
2010
14 years 10 months ago
2010
In this paper, we introduce a new P-type condition for nonlinear functions defined over Euclidean Jordan algebras, and study a continuation method for nonlinear complementarity pro...
124
click to vote
IPCO
1990
15 years 4 months ago
1990
We analyse the generalised assignment problem under the assumption that all coefficients are drawn uniformly and independently from [0,1]. We show that such problems can be solved...
110
click to vote
SSWMC
2004
15 years 4 months ago
2004
We analyze the complexity of the steganography problem and show that the decision version of the problem is NP-complete through transformation from the Knapsack problem. We also g...
101
click to vote
ICIP
2009
IEEE
16 years 4 months ago
2009
IEEE
Sparsity constraints are now very popular to regularized inverse problems. We review several approaches which have been proposed in the last ten years to solve inverse problems su...