95 search results - page 3 / 19 » Solving Large-Scale Nonlinear Programming Problems by Constr... |
147
click to vote
SIAMSC
2008
15 years 4 months ago
2008
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
111
click to vote
ICTAI
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, we develop heuristics for finding good starting points when solving large-scale nonlinear constrained optimization problems (COPs). We focus on nonlinear programmi...
121
click to vote
CEC
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper we introduce an evolutionary algorithm for solving a copper mine planning problem. In the last 10 years this realworld problem has been tackled using linear integer p...
113
click to vote
INFORMS
2008
15 years 4 months ago
2008
Most traditional routing problems assume perfect operability of all arcs and nodes. However, when independent arc failure probabilities exist, a secondary objective must be presen...
122
click to vote
CAV
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. We present a new method for the generation of linear invariants which reduces the problem to a non-linear constraint solving problem. Our method, based on Farkas’ Lemma...