603 search results - page 3 / 121 » A General Approximation Technique for Constrained Forest Pro... |
103
Voted
PPSN
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. The paper describes an evolutionary algorithm for the general nonlinear programming problem using a surrogate model. Surrogate models are used in optimization when model ...
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
91
Voted
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner forest and k-Steiner forest, when the vertices of the input graph are points in the Euc...
99
Voted
APPROX
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
88
Voted
SIAMCO
2002
14 years 11 months ago
2002
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...