default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Global Optimization, Volume 16
Volume 16, Number 1, January 2000
- Christian Kanzow:
Global Optimization Techniques for Mixed Complementarity Problems. 1-21 - Paul S. Bradley, Olvi L. Mangasarian:
k-Plane Clustering. 23-32 - George A. Anastassiou, Tomasz Rychlik:
Prokhorov Radius of a Neighborhood of Zero Described by Three Moment Constraints. 33-41 - Sanguthevar Rajasekaran:
On Simulated Annealing and Nested Annealing. 43-56 - M. Beatrice Lignola, Jacqueline Morgan:
Well-posedness for Optimization Problems with Constraints defined by Variational Inequalities having a unique solution. 57-67 - Ouayl Chadli, Hassan Riahi:
On Generalized Vector Equilibrium Problems. 69-75 - Oscar Barrientos, Rafael Correa:
An Algorithm for Global Minimization of Linearly Constrained Quadratic Functions. 77-93 - George Isac, George Xian-Zhi Yuan:
The Generic Stability and Existence of Essentially Connected Components of Solutions for Nonlinear Complementarity Problems. 95-105 - János D. Pintér:
Yair Censor and Stavros A. Zenios, Parallel Optimization - Theory, Algorithms, and Applications. Oxford University Press, New York/Oxford, 1997, xxviii+539 pages. ISBN 0-19-510062-X (US $ 85.00). 107-108
Volume 16, Number 2, February 2000
- Jaroslav Haslinger, D. Jedelský, Tomás Kozubek
, Josef Tvrdík:
Genetic and Random Search Methods in Optimal Shape Design Problems. 109-131 - Michael J. Best, Baoyan Ding:
A Decomposition Method for Global and Local Quadratic Minimization. 133-151 - Fabián Flores Bazán:
Optimal Solutions in an Allocation Process for a Continuum of Traders. 153-165 - Chung-Shang Shao, Richard H. Byrd, Elizabeth Eskow, Robert B. Schnabel:
Global Optimization For Molecular Clusters Using A New Smoothing Approach. 167-196
Volume 16, Number 3, March 2000
- Syuuji Yamada, Tetsuzo Tanino, Masahiro Inuiguchi:
An Inner Approximation Method for Optimization over the Weakly Efficient Set. 197-217 - Mihály Csaba Markót, Tibor Csendes, András Erik Csallner:
Multisection in Interval Branch-and-Bound Methods for Global Optimization II. Numerical Tests. 219-228 - De-Gang Liu, Xiang-Sun Zhang:
Test Problem Generator by Neural Network for Algorithms that Try Solving Nonlinear Programming Problems Globally. 229-243 - Manoel B. Campêlo, Simone Dantas, Susana Scheimberg:
A Note on a Penalty Function Approach for Solving Bilevel Linear Programs. 245-255 - Maria Cristina Recchioni, A. Scoccia:
A Stochastic Algorithm for Constrained Global Optimization. 257-270 - Konstantin Kogan, Toshihide Ibaraki:
Optimal Scheduling in Parallel and Serial Manufacturing Systems via the Maximum Principle. 271-294 - Hoang Duong Tuan:
Remarks on an algorithm for reverse convex programs. 295-297 - Don Jones:
Handbook of Test Problems in Local and Global Optimization by C.A. Floudas, P.M. Pardalos et al. In Noncovex Optimization and Its Applications, volume 33, Kluwer Academic Publishers, 1999. 299-300
Volume 16, Number 4, April 2000
- Harold P. Benson, Erjiang Sun:
Pivoting in an Outcome Polyhedron. 301-323 - Yuefan Deng, Carlos Rivera:
Approximate energy minimization for large Lennard-Jones clusters. 325-341 - David Mauricio, Nelson Maculan:
A Boolean Penalty Method for Zero-One Nonlinear Programming. 343-354 - X. Q. Yang, Duan Li:
Successive Optimization Method via Parametric Monotone Composition Formulation. 355-369 - András Erik Csallner, Tibor Csendes, Mihály Csaba Markót:
Multisection in Interval Branch-and-Bound Methods for Global Optimization - I. Theoretical Results. 371-392 - Marco Castellani:
A Dual Representation for Proper Positively Homogeneous Functions. 393-400
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-12-05 22:23 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:
