1182 search results - page 108 / 237 » Iterative Methods in Combinatorial Optimization |
144
click to vote
PVM
1998
Springer
15 years 7 months ago
1998
Springer
The problem of evaluating the dominant eigenvalue of real matrices using Monte Carlo numerical methods is considered. Three almost optimal Monte Carlo algorithms are presented:
127
click to vote
SIAMJO
2000
15 years 2 months ago
2000
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...
154
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
135
click to vote
GECCO
2003
Springer
15 years 8 months ago
2003
Springer
A network with restoration capability requires spare capacity to be used in the case of failure. Optimization of spare capacity is to find the minimum amount of spare capacity for ...
123
click to vote
NHM
2010
14 years 10 months ago
2010
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...