Journal: J. Global Optimization

Volume 3, Issue 4

397 -- 419D. J. White, G. Anandalingam. A penalty function approach for solving bi-level linear programs
421 -- 437Pierre Hansen, Brigitte Jaumard, Junjie Xiong. Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions
439 -- 462V. Visweswaran, Christodoulos A. Floudas. New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
463 -- 482Jonas Hasselberg, Panos M. Pardalos, George L. Vairaktarakis. Test case generators and computational results for the maximum clique problem
483 -- 500B. N. Pshenichnyi, A. A. Sosnovsky. The linearization method: Principal concepts and perspective directions
501 -- 518Helmut Ratschek, Jon G. Rokne. Experiments using interval analysis for solving a circuit design problem
519 -- 521W. B. Liu, Christodoulos A. Floudas. A remark on the GOP algorithm for global optimization
523 -- 526J. Ben Rosen, Katta G. Murty. Book reviews

Volume 3, Issue 3

261 -- 287Bruce W. Lamar. An improved branch and bound algorithm for minimum concave cost network flow problems
289 -- 309Jonathan F. Bard, Krishnamurthi Venkatraman, Thomas A. Feo. Single machine scheduling with flow time and earliness penalties
311 -- 324Phan Thien Thach. A generalized duality and applications
325 -- 335Takahito Kuno, Yasutoshi Yajima, Hiroshi Konno. An outer approximation method for minimizing the product of several convex functions on a convex set
337 -- 358Baoping Zhang, Graham R. Wood, W. P. Baritompa. Multidimensional bisection: The performance and the context
359 -- 375Tamás Rapcsák, Tibor Csendes. Nonlinear coordinate transformations for unconstrained optimization II. Theoretical background
377 -- 391Le D. Muu, Werner Oettli. Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
393 -- 396C. R. Rao, Panos M. Pardalos, B. N. Khoury. Book reviews

Volume 3, Issue 2

117 -- 131Douglass J. Wilde. Convexity analysis in detecting a steel plant hidden global optimum
133 -- 137Fabio Schoen. A wide class of test functions for global optimization
139 -- 156Limin He, Elijah Polak. Multistart method with estimation scheme for global satisfycing problems
157 -- 169Alberto Cambini, Siegfried Schaible, Claudio Sodini. Parametric linear fractional programming for an unbounded feasible region
171 -- 192Zelda B. Zabinsky, Robert L. Smith, J. F. McDonald, H. Edwin Romeijn, David E. Kaufman. Improving Hit-and-Run for global optimization
193 -- 212William Baritompa. Customizing methods for global optimization-a geometric viewpoint
213 -- 221Tibor Csendes, Tamás Rapcsák. Nonlinear coordinate transformations for unconstrained optimization I. Basic transformations
223 -- 232James M. Calvin. Consistency of a myopic Bayesian algorithm for one-dimensional global optimization
233 -- 242Vasile Postolica. New existence results for efficient points in locally convex spaces ordered by supernormal cones
243 -- 255Alexander Kaplan, Rainer Tichatschke. Iterative processes for solving incorrect convex variational problems
257 -- 259Ding-Zhu Du, Siriphong Lawphongpanich. Book reviews

Volume 3, Issue 1

1 -- 23Hoang Tuy, Athanasios Migdalas, Peter Värbrand. A global optimization approach for the linear two-level program
25 -- 47Ammar Salah El-Deen Hamed, Garth P. McCormick. Calculation of bounds on variables satisfying nonlinear inequality constraints
49 -- 66Scott M. Le Grand, Kenneth M. Merz Jr.. The application of the genetic algorithm to the minimization of potential energy functions
67 -- 78S. K. Zavriev. On the global optimization properties of finite-difference local descent algorithms
79 -- 94Andrew T. Phillips, J. Ben Rosen. Sufficient conditions for solving linearly constrained separable concave global minimization problems
95 -- 111Harold P. Benson. A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case