default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Global Optimization, Volume 10
Volume 10, Number 1, January 1997
- Marco Muselli:
A Theoretical Approach to Restart in Global Optimization. 1-16 - Markku Miettinen, Jaroslav Haslinger:
Finite Element Approximation of Vector-Valued Hemivariational Problems. 17-35 - Pierre Courrieu:
The Hyperbell Algorithm for Global Optimization: A Random Walk Using Cauchy Densities. 37-55 - Marco Locatelli:
Bayesian Algorithms for One-Dimensional Global Optimization. 57-76 - Michael J. Best, Baoyan Ding:
Global and Local Quadratic Minimization. 77-90 - Dominikus Noll:
Restoration of Degraded Images with Maximum Entropy. 91-103
Volume 10, Number 2, March 1997
- Benjamin W. Wah, Yao-Jen Chang:
Trace-Based Methods for Solving Nonlinear Global Optimization and Satisfiability Problems. 107-141 - Immanuel M. Bomze
:
Evolution towards the Maximum Clique. 143-164 - P. Brachetti, M. De Felice Ciccoli, Gianni Di Pillo, Stefano Lucidi:
A New Version of the Price's Algorithm for Global Optimization. 165-184 - Vladimir A. Grishagin, Yaroslav D. Sergeyev, Roman G. Strongin:
Parallel Characteristical Algorithms for Solving Problems of Global Optimization. 185-206 - George Isac, V. Bulavski, Vyacheslav Kalashnikov:
Exceptional Families, Topological Degree and Complementarity Problems. 207-225
Volume 10, Number 3, April 1997
- Brigitte Jaumard, Christophe Meyer, Hoang Tuy:
Generalized Convex Multiplicative Programming via Quasiconcave Minimization. 229-256 - Victor P. Gergel:
A Global Optimization Algorithm for Multivariate Functions with Lipschitzian First Derivatives. 257-281 - Mohsen Elhafsi, Sherman X. Bai:
The Common Cycle Economic Lot Scheduling Problem with Backorders: Benefits of Controllable Production Rates. 283-303 - Vladimir F. Demyanov, Vaithilingam Jeyakumar:
Hunting for a Smaller Convex Subdifferential. 305-326 - Wladyslaw Hejmo, Jacenty Kloch:
On Singular Phenomena in Certain Time-Optimal Problem. 327-349
Volume 10, Number 4, June 1997
- Lorant Porkolab, Leonid Khachiyan:
On the Complexity of Semidefinite Programs. 351-365 - Tetsuya Fujie, Masakazu Kojima:
Semidefinite Programming Relaxation for Nonconvex Quadratic Programs. 367-380 - Hanif D. Sherali, Cihan H. Tuncbilek:
Comparison of Two Reformulation-Linearization Technique Based Linear Programming Relaxations for Polynomial Programming Problems. 381-390 - Rainer E. Burkard, Stefan E. Karisch, Franz Rendl:
QAPLIB - A Quadratic Assignment Problem Library. 391-403 - Ana Isabel Barros, Rommert Dekker, J. B. G. Frenk, S. van Weeren:
Optimizing a General Optimal Replacement Model by Fractional Programming Techniques. 405-423 - Anatoliy D. Rikun:
A Convex Envelope Formula for Multilinear Functions. 425-437 - Arun K. Jagota, Kenneth W. Regan:
Performance of Neural Net Heuristics for Maximum Clique on Diverse Highly Compressible Graphs. 439-465
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-04 01:26 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:
