default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Optimization and Applications, Volume 21
Volume 21, Number 1, January 2002
- Martin Pelikan
, David E. Goldberg, Fernando G. Lobo:
A Survey of Optimization by Building and Using Probabilistic Models. 5-20 - Jeffrey E. Orosz, Sheldon H. Jacobson:
Finite-Time Performance Analysis of Static Simulated Annealing Algorithms. 21-53 - Marco Locatelli, Fabio Schoen:
Fast Global Optimization of Difficult Lennard-Jones Clusters. 55-70 - Nalan Gülpinar, Gautam Mitra, István Maros:
Creating Advanced Bases For Large Scale Linear Programs Exploiting Embedded Network Structure. 71-93 - Jayant Rajgopal, Dennis L. Bricker:
Solving Posynomial Geometric Programming Problems via Generalized Linear Programming. 95-109
Volume 21, Number 2, February 2002
- Stefano Lucidi, Marco Sciandrone:
A Derivative-Free Algorithm for Bound Constrained Optimization. 119-142 - José Luis Morales, Jorge Nocedal:
Enriched Methods for Large-Scale Unconstrained Optimization. 143-154 - Marcos Raydan, Benar Fux Svaiter:
Relaxed Steepest Descent and Cauchy-Barzilai-Borwein Method. 155-167 - Ian D. Coope, Christopher John Price:
Positive Bases in Numerical Optimization. 169-175 - Thomas F. Coleman, Jianguo Liu, Wei Yuan:
A New Trust-Region Algorithm for Equality Constrained Optimization. 177-199 - Gerald Gruber, Franz Rendl:
Computational Experience with Ill-Posed Problems in Semidefinite Programming. 201-212 - Yuri Levin, Adi Ben-Israel:
The Newton Bracketing Method for Convex Minimization. 213-229
Volume 21, Number 3, March 2002
- Cynthia Barnhart, Niranjan Krishnan, Daeki Kim, Keith A. Ware:
Network Design for Express Shipment Delivery. 239-262 - William W. Hager:
The Dual Active Set Algorithm and Its Application to Linear Programming. 263-275 - Fernanda Raupp, Clóvis C. Gonzaga:
A Center Cutting Plane Algorithm for a Likelihood Estimate Problem. 277-300 - Kim-Chuan Toh:
A Note on the Calculation of Step-Lengths in Interior-Point Methods for Semidefinite Programming. 301-310 - Mike C. Bartholomew-Biggs, Steven C. Parkhurst, Simon P. Wilson:
Using DIRECT to Solve an Aircraft Routing Problem. 311-323 - Maria J. Serna, Fatos Xhafa:
Approximating Scheduling Unrelated Parallel Machines in Parallel. 325-338 - José M. Valério de Carvalho:
A Note on Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problems. 339-340
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 2024-11-04 20:44 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:
