default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Global Optimization, Volume 21
Volume 21, Number 1, September 2001
- Ider Tseveendorj:
Piecewise-Convex Maximization Problems. 1-14 - Weimin Ma, Yin-Feng Xu, Kanliang Wang:
On-line k-Truck Problem and Its Competitive Algorithms. 15-25 - Joerg M. Gablonsky
, Carl T. Kelley:
A Locally-Biased form of the DIRECT Algorithm. 27-37 - Duan Li, Xiaoling Sun:
Existence of a Saddle Point in Nonconvex Constrained Optimization. 39-50 - X. X. Huang, X. Q. Yang:
Approximate Optimal Solutions and Nonlinear Lagrangian Functions. 51-65 - S. Y. Wu:
A Cutting Plane Approach to Solving Quadratic Infinite Programs on Measure Spaces. 67-87 - Domingos M. Cardoso:
Convex Quadratic Programming Approach. 89 - Domingos M. Cardoso:
Convex Quadratic Programming Approach to the Maximum Matching Problem. 91-106 - Georgios E. Stavroulakis:
Helmut Neunzert and Abul Hasan Siddiqi Topics in Industrial Mathematics. Case Studies and Related Mathematical Methods. Applied Optimization, Vol. 42. 107-109
Volume 21, Number 2, October 2001
- James Abello, Sergiy Butenko, Panos M. Pardalos, Mauricio G. C. Resende:
Finding independent sets in a graph using continuous multivariable polynomial formulations. 111-137 - Marcus Brazil, J. Hyam Rubinstein, Doreen A. Thomas, Jia F. Weng, Nicholas C. Wormald:
Gradient-constrained minimum networks. I. Fundamentals. 139-155 - Liqun Qi, Yu-Fei Yang:
A Globally and Superlinearly Convergent SQP Algorithm for Nonlinear Constrained Optimization. 157-184 - Xiaoling Sun, K. I. M. McKinnon, Duan Li:
A convexification method for a class of global optimization problems with applications to reliability optimization. 185-199 - Ju-Liang Zhang, Xiang-Sun Zhang:
A Modified SQP Method with Nonmonotone Linesearch Technique. 201-218
Volume 21, Number 3, November 2001
- Rafael Blanquero, Emilio Carrizosa, Eduardo Conde:
Finding GM-estimators with global optimization techniques. 223-237 - Eligius M. T. Hendrix, Pilar Martínez Ortigosa, Inmaculada García:
On success rates for controlled random search. 239-263 - Antonina Kuznetsova, Alexander S. Strekalovsky:
On solving the maximum clique problem. 265-288 - Pierluigi Maponi, Francesco Zirilli:
A Class of Global Optimization Problems as Models of the Phase Unwrapping Problem. 289-316 - Yaroslav D. Sergeyev, Domenico Famularo, Paolo Pugliese:
Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints. 317-341
Volume 21, Number 4, December 2001
- Donald R. Jones:
A Taxonomy of Global Optimization Methods Based on Response Surfaces. 345-383 - Xiuzhen Cheng, Bhaskar DasGupta, Bing Lu:
Polynomial Time Approximation Scheme for Symmetric Rectilinear Steiner Arborescence Problem. 385-396 - Vicente Campos, Fred W. Glover, Manuel Laguna, Rafael Martí:
An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem. 397-414 - Steven E. Cox, Raphael T. Haftka, Chuck A. Baker, Bernard Grossman, William H. Mason, Layne T. Watson:
A Comparison of Global Optimization Methods for the Design of a High-speed Civil Transport. 415-432 - T. Amahroq, Nazih Abderrazzak Gadhi:
On the Regularity Condition for Vector Programming Problems. 433-441 - Jean-Baptiste Hiriart-Urruty:
Global Optimality Conditions in Maximizing a Convex Quadratic Function under Convex Quadratic Constraints. 443-453
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-08-15 01:36 CEST 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:
