default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Global Optimization, Volume 24
Volume 24, Number 1, September 2002
- Ioannis Papamichail, Claire S. Adjiman
:
A Rigorous Global Optimization Algorithm for Problems with Ordinary Differential Equations. 1-33 - Stefan Ratschan:
Search Heuristics for Box Decomposition Methods. 35-49 - Albert A. Groenwold, Jan A. Snyman:
Global Optimization using Dynamic Search Trajectories. 51-60 - Dominique Fortin, Ider Tseveendorj:
Piecewise-Convex Maximization Problems: Algorithm and Computational Experiments. 61-77 - S. Ketabi, Franz J. M. Salzborn:
A Concavity Result for Network Design Problems. 79-88 - Marcus Porembski:
Cone Adaptation Strategies for a Finite and Exact Cutting Plane Algorithm for Concave Minimization. 89-107
Volume 24, Number 2, October 2002
- Alexander M. Rubinov:
Preface. 109 - Mikhail Andramonov:
Solving Problems with Min-Type Functions by Disjunctive Programming. 115-132 - Dominique Az, Jean-Baptiste Hiriart-Urruty:
Optimal Hoffman-Type Estimates in Eigenvalue and Semidefinite Inequality Constraints. 133-147 - Lynn Margaret Batten, Gleb Beliakov:
Fast Algorithm for the Cutting Angle Method of Global Optimization. 149-161 - Immanuel M. Bomze, Etienne de Klerk:
Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive Programming. 163-185 - Rafail N. Gasimov:
Augmented Lagrangian Duality and Nondifferentiable Optimization Methods in Nonconvex Programming. 187-203 - Y. Liu, Kok Lay Teo:
An Adaptive Dual Parametrization Algorithm for Quadratic Semi-infinite Programming Problems. 205-217 - Stefano Lucidi, Veronica Piccialli:
New Classes of Globally Convexized Filled Functions for Global Optimization. 219-236 - Akiko Takeda, Katsuki Fujisawa, Yusuke Fukaya, Masakazu Kojima:
Parallel Implementation of Successive Convex Relaxation Methods for Quadratic Optimization Problems. 237-260 - Liquin Qi, Yu-Fei Yang:
NCP Functions Applied to Lagrangian Globalization for the Nonlinear Complementarity Problem. 261-283
Volume 24, Number 3, November 2002
- Anatoly S. Antipin:
Gradient Approach of Computing Fixed Points of Equilibrium Problems. 285-309 - Robert A. Stubbs, Sanjay Mehrotra:
Generating Convex Polynomial Inequalities for Mixed 0-1 Programs. 311-332 - Masakazu Kojima, Levent Tunçel:
Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related Problems. 333-348 - Tim Van Voorhis:
A Global Optimization Algorithm using Lagrangian Underestimates and the Interval Newton Method. 349-370 - Michael Heitzer:
Structural Optimization with FEM-based Shakedown Analyses. 371-384
Volume 24, Number 4, December 2002
- Mohit Tawarmalani, Shabbir Ahmed, Nikolaos V. Sahinidis:
Global Optimization of 0-1 Hyperbolic Programs. 385-416 - P. S. V. Nataray, Ketan Kotecha:
An Algorithm for Global Optimization using the Taylor-Bernstein Form as Inclusion Function. 417-436 - Joonmo Kim, Mihaela Cardei, Ionut Cardei, Xiaohua Jia:
A Polynomial Time Approximation Scheme for the Grade of Service Steiner Minimum Tree Problem. 437-448 - Weimin Ma, Jane You, Yin-Feng Xu, James N. K. Liu, Kanliang Wang:
On the On-line Number of Snacks Problem. 449-462 - Frank K. Hwang, Y. M. Wang, J. S. Lee:
Sortability of Multi-partitions. 463-472 - O. L. Mangasarian:
Set Containment Characterization. 473-480
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 22:08 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:
