Some computational methods for systems of nonlinear equations and systems of polynomial equations W. Forster OriginalPaper Pages: 317 - 356
Application of the renormalization group to deterministic global minimization of molecular conformation energy functions David Shalloway OriginalPaper Pages: 281 - 311
An interval branch and bound algorithm for bound constrained optimization problems R. Baker Kearfott OriginalPaper Pages: 259 - 280
A parallel stochastic method for solving linearly constrained concave global minimization problems A. T. PhillipsJ. B. RosenM. Van Vliet OriginalPaper Pages: 243 - 258
A continuous method for computing bounds in integer quadratic optimization problems A. KamathN. Karmarkar OriginalPaper Pages: 229 - 241
A stochastic probing algorithm for global optimization Purushottam W. LaudL. Mark BerlinerPrem K. Goel OriginalPaper Pages: 209 - 224
An optimality criterion for global quadratic optimization Arnold Neumaier OriginalPaper Pages: 201 - 208
Tuning distributed control algorithms for optimal functioning Marc Bui OriginalPaper Pages: 177 - 199
The normal score transformation applied to a multi-univariate method of global optimization Cary D. PerttunenBruce E. Stuckman OriginalPaper Pages: 167 - 176
Unconstrained 0–1 nonlinear programming: A nondifferentiable approach Philippe Michelon OriginalPaper Pages: 155 - 165
On nonconvex optimization problems with separated nonconvex variables Hoang Tuy OriginalPaper Pages: 133 - 144
A global optimization algorithm for polynomial programming problems using a Reformulation-Linearization Technique Hanif D. SheraliCihan H. Tuncbilek OriginalPaper Pages: 101 - 112
Unconstrained and constrained global optimization of polynomial functions in one variable V. VisweswaranC. A. Floudas OriginalPaper Pages: 73 - 99
Global optimization of a nonconvex single facility location problem by sequential unconstrained convex minimization Hoang TuyFaiz A. Al-Khayyal OriginalPaper Pages: 61 - 71
Reduction of indefinite quadratic programs to bilinear programs Pierre HansenBrigitte Jaumard OriginalPaper Pages: 41 - 60
A new simplicial cover technique in constrained global optimization R. HorstN. V. ThoaiJ. De Vries OriginalPaper Pages: 1 - 19
An application of Lipschitzian global optimization to product design E. M. T. HendrixJ. Pintér OriginalPaper Pages: 389 - 401
A trajectory algorithm based on the gradient method I. The search on the quasioptimal trajectories E. G. SturuaS. K. Zavriev OriginalPaper Pages: 375 - 388
Bounding the set of solutions of a perturbed global optimization problem E. R. Hansen OriginalPaper Pages: 359 - 374
A global optimization approach for solving the convex multiplicative programming problem Nguyen Van Thoai OriginalPaper Pages: 341 - 357
On when to stop sampling for the maximum C. G. E. BoenderA. H. G. Rinnooy Kan OriginalPaper Pages: 331 - 340
Global search algorithms for minimum concave-cost network flow problems G. M. GuisewiteP. M. Pardalos OriginalPaper Pages: 309 - 330
A simple solution of the van der Waerden permanent problem Morgan A. Hanson OriginalPaper Pages: 287 - 293
A parametric successive underestimation method for convex multiplicative programming problems Takahito KunoHiroshi Konno OriginalPaper Pages: 267 - 285
Algorithms for the single-source uncapacitated minimum concave-cost network flow problem G. M. GuisewiteP. M. Pardalos OriginalPaper Pages: 245 - 265
Polyhedral annexaton, dualization and dimension reduction technique in global optimization Hoang Tuy OriginalPaper Pages: 229 - 244
Stochastic techniques for global optimization: A survey of recent advances Fabio Schoen OriginalPaper Pages: 207 - 228
On solving a D.C. programming problem by a sequence of linear programs R. HorstT. Q. PhongJ. de Vries OriginalPaper Pages: 183 - 203
Global optimization of fractional programs P. M. PardalosA. T. Phillips OriginalPaper Pages: 173 - 182
Efficient algorithms for solving rank two and rank three bilinear programming problems Yasutoshi YajimaHiroshi Konno OriginalPaper Pages: 155 - 171
Mathematical programs with a two-dimensional reverse convex constraint P. T. ThachR. E. BurkardW. Oettli OriginalPaper Pages: 145 - 154
What can interval analysis do for global optimization? H. RatschekR. L. Voller OriginalPaper Pages: 111 - 130
An all-linear programming relaxation algorithm for optimizing over the efficient set Harold P. Benson OriginalPaper Pages: 83 - 104
Parametric simplex algorithms for solving a special class of nonconvex minimization problems Hiroshi KonnoYasutoshi YajimaTomomi Matsui OriginalPaper Pages: 65 - 81
