default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Global Optimization, Volume 1
Volume 1, Number 1, March 1991
- Bruno Betrò:
Bayesian methods in global optimization. 1-14 - Panos M. Pardalos, Stephen A. Vavasis:
Quadratic programming with one negative eigenvalue is NP-hard. 15-22 - Hoang Tuy:
Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms. 23-36 - Pierre Hansen, Brigitte Jaumard, Shi-Hui Lu:
On Timonov's algorithm for global optimization of univariate Lipschitz functions. 37-46 - Hubertus Th. Jongen, Gerd-Wilhelm Weber
:
Nonlinear optimization: Characterization of structural stability. 47-64 - Hiroshi Konno, Yasutoshi Yajima, Tomomi Matsui:
Parametric simplex algorithms for solving a special class of nonconvex minimization problems. 65-81 - Harold P. Benson:
An all-linear programming relaxation algorithm for optimizing over the efficient set. 83-104
Volume 1, Number 2, June 1991
- Helmut Ratschek, Rudolf L. Voller:
What can interval analysis do for global optimization? 111-130 - Jørgen Tind:
Decomposition in global optimization. 131-144 - Phan Thien Thach, Rainer E. Burkard, Werner Oettli:
Mathematical programs with a two-dimensional reverse convex constraint. 145-154 - Yasutoshi Yajima, Hiroshi Konno:
Efficient algorithms for solving rank two and rank three bilinear programming problems. 155-171 - Panos M. Pardalos, Andrew T. Phillips:
Global optimization of fractional programs. 173-182 - Reiner Horst, Thai Quynh Phong, Nguyen V. Thoai, Jakob de Vries:
On solving a D.C. programming problem by a sequence of linear programs. 183-203
Volume 1, Number 3, September 1991
- Fabio Schoen:
Stochastic techniques for global optimization: A survey of recent advances. 207-228 - Hoang Tuy:
Polyhedral annexaton, dualization and dimension reduction technique in global optimization. 229-244 - G. M. Guisewite, Panos M. Pardalos:
Algorithms for the single-source uncapacitated minimum concave-cost network flow problem. 245-265 - Takahito Kuno, Hiroshi Konno:
A parametric successive underestimation method for convex multiplicative programming problems. 267-285 - Morgan A. Hanson:
A simple solution of the van der Waerden permanent problem. 287-293 - W. Seidel:
An open optimization problem in statistical quality control. 295-303
Volume 1, Number 4, December 1991
- G. M. Guisewite, Panos M. Pardalos:
Global search algorithms for minimum concave-cost network flow problems. 309-330 - C. G. E. Boender, A. H. G. Rinnooy Kan:
On when to stop sampling for the maximum. 331-340 - Nguyen V. Thoai:
A global optimization approach for solving the convex multiplicative programming problem. 341-357 - Eldon R. Hansen:
Bounding the set of solutions of a perturbed global optimization problem. 359-374 - E. G. Sturua, S. K. Zavriev:
A trajectory algorithm based on the gradient method I. The search on the quasioptimal trajectories. 375-388 - Eligius M. T. Hendrix, János D. Pintér:
An application of Lipschitzian global optimization to product design. 389-401
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-10-31 01:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
