


default search action
Computational Optimization and Applications, Volume 44
Volume 44, Number 1, October 2009
- Fredi Tröltzsch:
Editorial. 1-2 - Olaf Benedix, Boris Vexler:
A posteriori error estimation and adaptivity for elliptic optimal control problems with state constraints. 3-25 - Svetlana Cherednichenko, Arnd Rösch:
Error estimates for the discretization of elliptic control problems with pointwise control and state constraints. 27-55 - Roland Griesse
, Daniel Wachsmuth:
Sensitivity analysis and the adjoint update strategy for an optimal control problem with mixed control-state constraints. 57-81 - Fredi Tröltzsch, Stefan Volkwein:
POD a-posteriori error estimates for linear-quadratic optimal control problems. 83-115 - Manlio Gaudioso
, Giovanni Giallombardo
, Giovanna Miglionico
:
On solving the Lagrangian dual of integer programs via an incremental approach. 117-138 - Yanjun Wang, Li Tao Li, Zhian Liang:
A general algorithm for solving Generalized Geometric Programming with nonpositive degree of difficulty. 139-158
Volume 44, Number 2, November 2009
- Georg Stadler:
Elliptic optimal control problems with L1-control cost and applications for the placement of control devices. 159-181 - Christian Meyer, Irwin Yousept
:
Regularization of state-constrained elliptic optimal control problems with nonlocal radiation interface conditions. 183-212 - María D. González-Lima
, Hua Wei, Henry Wolkowicz:
A stable primal-dual approach for linear programming under nondegeneracy assumptions. 213-247 - Gabriele Eichfelder
:
Scalarizations for adaptively solving multi-objective optimization problems. 249-273 - Daniele Depetrini, Marco Locatelli
:
A FPTAS for a class of linear multiplicative problems. 275-288 - Dulce Rosas, Jordi Castro
, Lídia Montero
:
Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem. 289-313 - Wolfgang Achtziger, Mathias Stolpe
:
Global optimization of truss topology with discrete bar areas - Part II: Implementation and numerical results. 315-341 - Jozef Kratica
, Vera Kovacevic-Vujcic, Mirjana Cangalovic:
Computing the metric dimension of graphs by genetic algorithms. 343-361
Volume 44, Number 3, December 2009
- Oleg A. Prokopyev
:
On equivalent reformulations for absolute value equations. 363-372 - Jean-Pierre Dussault:
Improved convergence order for augmented penalty algorithms. 373-383 - Claude Lemaréchal, Adam Ouorou, Georgios Petrou:
A bundle-type algorithm for routing in telecommunication data networks. 385-409 - Micael Gallego
, Abraham Duarte
, Manuel Laguna, Rafael Martí
:
Hybrid heuristics for the maximum diversity problem. 411-426 - Elizabeth W. Karas, Elvio A. Pilotta, Ademir A. Ribeiro:
Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems. 427-441 - Friedemann Leibfritz, Jan H. Maruhn:
A successive SDP-NSDP approach to a robust optimization problem in finance. 443-466 - Dexuan Xie, Qin Ni:
An incomplete Hessian Newton minimization method and its application in a chemical database problem. 467-485 - Mercedes Landete
, Alfredo Marín
:
New facets for the two-stage uncapacitated facility location polytope. 487-519 - COAP 2008 best paper award: Paper of M. Weiser, T. Gänzler, and A. Schiela. 521-524
- COAP 2008 best paper award: Paper of P.M. Hahn, B.-J. Kim, M. Guignard, J.M. Smith and Y.-R. Zhu. 525-530

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.