Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarJournal of Global Optimization, Volume 3
Volume 3, Number 1, March 1993
Hoang Tuy, Athanasios Migdalas, Peter Värbrand:
A global optimization approach for the linear two-level program. 1-23- Ammar Salah El-Deen Hamed, Garth P. McCormick:
Calculation of bounds on variables satisfying nonlinear inequality constraints. 25-47 - Scott M. Le Grand, Kenneth M. Merz Jr.:
The application of the genetic algorithm to the minimization of potential energy functions. 49-66 - S. K. Zavriev:
On the global optimization properties of finite-difference local descent algorithms. 67-78 - Andrew T. Phillips, J. Ben Rosen:
Sufficient conditions for solving linearly constrained separable concave global minimization problems. 79-94 - Harold P. Benson:
A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case. 95-111
Volume 3, Number 2, June 1993
- Limin He, Elijah Polak:
Multistart method with estimation scheme for global satisfycing problems. 139-156 - Alberto Cambini, Siegfried Schaible, Claudio Sodini:
Parametric linear fractional programming for an unbounded feasible region. 157-169 - Zelda B. Zabinsky, Robert L. Smith, J. F. McDonald, H. Edwin Romeijn, David E. Kaufman:
Improving Hit-and-Run for global optimization. 171-192 - Tibor Csendes, Tamás Rapcsák:
Nonlinear coordinate transformations for unconstrained optimization I. Basic transformations. 213-221 - James M. Calvin:
Consistency of a myopic Bayesian algorithm for one-dimensional global optimization. 223-232 - Vasile Postolica:
New existence results for efficient points in locally convex spaces ordered by supernormal cones. 233-242 - Alexander Kaplan, Rainer Tichatschke:
Iterative processes for solving incorrect convex variational problems. 243-255
Volume 3, Number 3, September 1993
- Bruce W. Lamar:
An improved branch and bound algorithm for minimum concave cost network flow problems. 261-287 - Jonathan F. Bard, Krishnamurthi Venkatraman, Thomas A. Feo:
Single machine scheduling with flow time and earliness penalties. 289-309 - Takahito Kuno, Yasutoshi Yajima, Hiroshi Konno:
An outer approximation method for minimizing the product of several convex functions on a convex set. 325-335 - Baoping Zhang, Graham R. Wood, W. P. Baritompa:
Multidimensional bisection: The performance and the context. 337-358 - Tamás Rapcsák, Tibor Csendes:
Nonlinear coordinate transformations for unconstrained optimization II. Theoretical background. 359-375 - Le D. Muu, Werner Oettli:
Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems. 377-391
Volume 3, Number 4, December 1993
- D. J. White, G. Anandalingam:
A penalty function approach for solving bi-level linear programs. 397-419 - Pierre Hansen, Brigitte Jaumard, Junjie Xiong:
Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions. 421-437 - V. Visweswaran, Christodoulos A. Floudas:
New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints. 439-462 - Jonas Hasselberg, Panos M. Pardalos, George L. Vairaktarakis:
Test case generators and computational results for the maximum clique problem. 463-482 - B. N. Pshenichnyi, A. A. Sosnovsky:
The linearization method: Principal concepts and perspective directions. 483-500 - Helmut Ratschek, Jon G. Rokne:
Experiments using interval analysis for solving a circuit design problem. 501-518
maintained by 
, founded at 
, founded at 
last updated on 2019-04-18 22:17 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
