default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Optimization and Applications, Volume 9
Volume 9, Number 1, January 1998
- Michael Patriksson:
Decomposition Methods for Differentiable Optimization Problems over Cartesian Product Sets. 5-42 - C. T. Kelley, Ekkehard W. Sachs:
Local Convergence of the Symmetric Rank-One Iteration. 43-63 - Mike C. Bartholomew-Biggs:
Using Forward Accumulation for Automatic Differentiation of Implicitly-Defined Functions. 65-84 - Blas Pelegrín, Lázaro Cánovas:
The Minimum Covering lpb-Hypersphere Problem. 85-97
Volume 9, Number 2, February 1998
- Abbas Seifi, Levent Tunçel
:
A Constant-Potential Infeasible-Start Interior-Point Algorithm with Computational Experiments and Applications. 107-152 - Steven A. Gabriel:
A Hybrid Smoothing Method for Mixed Nonlinear Complementarity Problems. 153-173 - Charles R. Johnson, Brenda Kroschel, Henry Wolkowicz:
An Interior-Point Method for Approximate Positive Semidefinite Completions. 175-190 - Mehiddin Al-Baali:
Global and Superlinear Convergence of a Restricted Class of Self-Scaling Methods with Inexact Line Searches, for Convex Functions. 191-203
Volume 9, Number 3, March 1998
- Pamela H. Vance:
Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem. 211-228 - Hong Yan, Gerald L. Thompson:
Finding Postal Carrier Walk Paths in Mixed Graphs. 229-247 - Amal de Silva, David Abramson:
A Parallel Interior Point Method and Its Application to Facility Location Problems. 249-273 - Alberto Colorni, Marco Dorigo, Vittorio Maniezzo:
Metaheuristics for High School Timetabling. 275-298
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 2026-05-18 00:08 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:
