3250 search results - page 173 / 650 » An Algorithm to Solve a Linear Program |
172
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
175
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
154
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
163
click to vote
PVM
1999
Springer
15 years 10 months ago
1999
Springer
The problem of solving sparse Systems of Linear Algebraic Equations (SLAE) by parallel Monte Carlo numerical methods is considered. The almost optimal Monte Carlo algorithms are pr...
163
click to vote
SIAMJO
2008
15 years 6 months ago
2008
For the problem of solving maximal monotone inclusions, we present a rather general class of algorithms, which contains hybrid inexact proximal point methods as a special case and ...