


default search action
Journal of Global Optimization, Volume 13
Volume 13, Number 1, July 1998
- Harold P. Benson:

An Outer Approximation Algorithm for Generating All Efficient Extreme Points in the Outcome Set of a Multiple Objective Linear Programming Problem. 1-24 - Marco Locatelli:

Relaxing the Assumptions of the Multilevel Single Linkage Algorithm. 25-42 - Konstantin Kogan

, Eugene Khmelnitsky:
Tracking Demands in Optimal Control of Managerial Systems with Continuously-Divisible, Doubly Constrained Resources. 43-59 - Alexander S. Strekalovsky

, Ider Tseveendorj:
Testing the ℜ- strategy for a Reverse Convex Problem. 61-74 - Jean-François Puget, Pascal Van Hentenryck:

A Constraint Satisfaction Approach to a Circuit Design Problem. 75-93 - Derek R. Dreyer, Michael L. Overton:

Two Heuristics for the Euclidean Steiner Tree Problem. 95-106
Volume 13, Number 2, September 1998
- Francis H. Clarke, Jean-Baptiste Hiriart-Urruty, Yuri S. Ledyaev:

On Global Optimality Conditions for Nonlinear Optimal Control Problems. 109-122 - Reiner Horst, Ulrich Raber:

Convergent Outer Approximation Algorithms for Solving Unary Programs. 123-149 - Yasutoshi Yajima, Tetsuya Fujie:

A Polyhedral Approach for Nonconvex Quadratic Programming Problems with Box Constraints. 151-170 - Le Thi Hoai An

, Pham Dinh Tao:
A Branch and Bound Method via d.c. Optimization Algorithms and Ellipsoidal Technique for Box Constrained Nonconvex Quadratic Problems. 171-206 - Marco Gaviano, Daniela Lera:

Test Functions with Variable Attraction Regions for Global Optimization Problems. 207-223
Volume 13, Number 3, October 1998
- Hiroshi Konno, Chenggang Gao, Ichiroh Saitoh:

Cutting Plane/Tabu Search Algorithms for Low Rank Concave Quadratic Programming Problems. 225-240 - Frans M. Coetzee, Virginia L. Stonick:

On Producing Multiple Solutions Using Repeated Trials. 241-254 - Chyi-Yeu Lin, I-Ming Huang:

A Crystal Growth Approach for Topographical Global Optimization. 255-267 - Markku Miettinen, P. D. Panagiotopoulos:

Hysteresis and Hemivariational Inequalities: Semilinear Case. 269-298 - E. Levitin, Rainer Tichatschke:

A Branch-and-Bound Approach for Solving a Class of Generalized Semi-infinite Programming Problems. 299-315 - Bernard Lemaire, Michel Volle:

A General Duality Scheme for Nonconvex Minimization Problems with a Strict Inequality Constraint. 317-327
Volume 13, Number 4, December 1998
- Werner Oettli, Dirk Schläger:

Conjugate Functions for Convex and Nonconvex Duality. 337-347 - Jean-Baptiste Hiriart-Urruty:

Conditions for Global Optimality 2. 349-367 - Immanuel M. Bomze

:
On Standard Quadratic Optimization Problems. 369-387 - Alexander Kaplan, Rainer Tichatschke:

Proximal Point Methods and Nonconvex Optimization. 389-406 - Brigitte Jaumard, Christophe Meyer:

A Simplified Convergence Proof for the Cone Partitioning Algorithm. 407-416 - Ulrich Raber:

A Simplicial Branch-and-Bound Method for Solving Nonconvex All-Quadratic Programs. 417-432 - Zelda B. Zabinsky:

Stochastic Methods for Practical Global Optimization. 433-444 - Fabio Schoen:

Random and Quasi-Random Linkage Methods in Global Optimization. 445-454 - Donald R. Jones

, Matthias Schonlau
, William J. Welch:
Efficient Global Optimization of Expensive Black-Box Functions. 455-492

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














