![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Journal of Global Optimization, Volume 19
Volume 19, Number 1, January 2001
- Hanif D. Sherali, Shivaram Subramanian
, G. V. Loganathan:
Effective Relaxations and Partitioning Schemes for Solving Water Distribution Network Design Problems to Global Optimality. 1-26 - Esin Onbasçioglu, Linet Özdamar
:
Parallel Simulated Annealing Algorithms in Global Optimization. 27-50 - Ding-Zhu Du, Frank K. Hwang, Yunjae Jung, Hung Q. Ngo:
Optimal Consecutive-k-out-of-(2k+1): G Cycle. 51-60 - José Fernández
, Blas Pelegrín:
Using Interval Analysis for Solving Planar Single-Facility Location Problems: New Discarding Tests. 61-81 - Roland W. Freund, Florian Jarre:
Solving the Sum-of-Ratios Problem by an Interior-Point Method. 83-102
Volume 19, Number 2, February 2001
- Christopher C. Skiscim, Susan W. Palocsay:
Minimum Spanning Trees with Sums of Ratios. 103-120 - Rainer E. Burkard, Helidon Dollani, Phan Thien Thach:
Linear Approximations in a Dynamic Programming Approach for the Uncapacitated Single-Source Minimum Concave Cost Network Flow Problem in Acyclic Networks. 121-139 - Muhammad Aslam Noor
:
Iterative Schemes for Multivalued Quasi Variational Inclusions. 141-150 - Xian Liu:
Finding Global Minima with a Computable Filled Function. 151-161 - Jean-Paul Penot:
Duality for Anticonvex Programs. 163-182 - Wieslawa T. Obuchowska:
Exceptional Families and Existence Results for Nonlinear Complementarity Problem. 183-198
Volume 19, Number 3, March 2001
- Hans-Martin Gutmann:
A Radial Basis Function Method for Global Optimization. 201-227 - James M. Calvin
, Antanas Zilinskas:
On Convergence of a P-Algorithm Based on a Statistical Model of Continuously Differentiable Functions. 229-245 - Leocadio González Casado
, J. A. Martínez, Inmaculada García
:
Experiments with a new selection criterion in a fast interval optimization algorithm. 247-264 - Pilar M. Ortigosa
, Inmaculada García
, Márk Jelasity
:
Reliability and Performance of UEGO, a Clustering-based Global Optimizer. 265-289 - Domingos M. Cardoso
:
Convex Quadratic Programming Approach to the Maximum Matching Problem. 291-306 - Tibor Csendes:
New Subinterval Selection Criteria for Interval Global Optimization. 307-327
Volume 19, Number 4, April 2001
- Hong-Xuan Huang
, Panos M. Pardalos, Zuo-Jun Max Shen
:
A Point Balance Algorithm for the Spherical Code Problem. 329-344 - Jianzhong Zhang, Guoshan Liu:
A New Extreme Point Algorithm and Its Application in PSQP Algorithms for Solving Mathematical Programs with Linear Complementarity Constraints. 345-361 - Qiaoming Han, Li-Zhi Liao
, Houduo Qi
, Liqun Qi
:
Stability Analysis of Gradient-Based Neural Networks for Optimization Problems. 363-381 - O. Polgár, M. Fried, T. Lohner, I. Bársony:
A Combined Topographical Search Strategy with Ellipsometric Application. 383-401 - Hong-Seo Ryoo, Nikolaos V. Sahinidis
:
Analysis of Bounds for Multilinear Functions. 403-424 - Guoliang Xue:
Handbook of Combinatorial Optimization DingZhu Du and Panos M. Pardalos (co-editors), Kluwer Academic Publishers, 1998, Vols. 1-3, ISBN: 0-7923-5285-8. 1-3
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.