default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Optimization and Applications, Volume 40
Volume 40, Number 1, May 2008
- Nicholas I. M. Gould
:
How good are projection methods for convex feasibility problems? 1-12 - Mohamed Haouari, Safa Bhar Layeb, Hanif D. Sherali:
The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches. 13-39 - R. Silva, João Soares, Luís Nunes Vicente:
Local analysis of the feasible primal-dual interior-point method. 41-57 - Wenyu Sun, Liusheng Hou, Chuangyin Dang:
A modified trust region method with Beale's PCG technique for optimization. 59-72 - Gio K. Kao, Sheldon H. Jacobson:
Finding preferred subsets of Pareto optimal solutions. 73-95 - Jinhai Chen:
The convergence analysis of inexact Gauss-Newton methods for nonlinear problems. 97-118
Volume 40, Number 2, June 2008
- Krzysztof Walkowiak:
Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks. 119-141 - Hande Y. Benson, David F. Shanno:
Interior-point methods for nonconvex nonlinear programming: regularization and warmstarts. 143-189 - John A. Ford, Yasushi Narushima, Hiroshi Yabe:
Multi-step nonlinear conjugate gradient methods for unconstrained minimization. 191-216 - Jian He, Alex Verstak, Layne T. Watson, Masha Sosonkina:
Design and implementation of a massively parallel version of DIRECT. 217-245 - Wolfgang Achtziger, Mathias Stolpe:
Global optimization of truss topology with discrete bar areas - Part I: theory of relaxed problems. 247-280 - Karsten Eppler, Helmut Harbrecht, Mario S. Mommer:
A new fictitious domain method in shape optimization. 281-298
Volume 40, Number 3, July 2008
- Lewis Ntaimo, Suvrajeet Sen:
A comparative study of decomposition algorithms for stochastic combinatorial optimization. 299-319 - Prattana Punnakitikashem, Jay M. Rosenberger, Deborah F. Buckley-Behan:
Stochastic programming for nurse assignment. 321-349 - Peter M. Hahn, Bum-Jin Kim, Monique Guignard, J. MacGregor Smith, Yi-Rong Zhu:
An algorithm for the generalized quadratic assignment problem. 351-372 - L. Ferreira-Mendonça, Véra Lucia Rocha Lopes, J. M. Martínez:
Quasi-Newton acceleration for equality-constrained minimization. 373-388 - Jein-Shan Chen, Shaohua Pan:
A family of NCP functions and a descent method for the nonlinear complementarity problem. 389-404 - Francisco J. González-Castaño, Enrique Costa-Montenegro, Juan C. Burguillo-Rial, Ubaldo M. García-Palomares:
Outdoor WLAN planning via non-monotone derivative-free optimization: algorithm adaptation and case study. 405-419
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-05-18 20:09 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:
