| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
|
Jiang, Jianlin
|
|
2011
|
51 |
3 |
p. 1275-1295
|
article
|
| 2 |
A benchmark library and a comparison of heuristic methods for the linear ordering problem
|
Martí, Rafael
|
|
2010
|
51 |
3 |
p. 1297-1317
|
article
|
| 3 |
A combinatorial optimization algorithm for solving the branchwidth problem
|
Smith, J. Cole
|
|
2011
|
51 |
3 |
p. 1211-1229
|
article
|
| 4 |
A constraint-reduced variant of Mehrotra’s predictor-corrector algorithm
|
Winternitz, Luke B.
|
|
2011
|
51 |
3 |
p. 1001-1036
|
article
|
| 5 |
A DC programming approach for solving the symmetric Eigenvalue Complementarity Problem
|
Le Thi, Hoai An
|
|
2010
|
51 |
3 |
p. 1097-1117
|
article
|
| 6 |
A proximal point algorithm for the monotone second-order cone complementarity problem
|
Wu, Jia
|
|
2011
|
51 |
3 |
p. 1037-1063
|
article
|
| 7 |
Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
|
Birgin, Ernesto G.
|
|
2011
|
51 |
3 |
p. 941-965
|
article
|
| 8 |
Capital rationing problems under uncertainty and risk
|
Beraldi, Patrizia
|
|
2011
|
51 |
3 |
p. 1375-1396
|
article
|
| 9 |
Generating equidistant representations in biobjective programming
|
Faulkenberg, Stacey L.
|
|
2011
|
51 |
3 |
p. 1173-1210
|
article
|
| 10 |
Heuristics for a project management problem with incompatibility and assignment costs
|
Zufferey, Nicolas
|
|
2010
|
51 |
3 |
p. 1231-1252
|
article
|
| 11 |
How good are extrapolated bi-projection methods for linear feasibility problems?
|
Gould, Nicholas I. M.
|
|
2011
|
51 |
3 |
p. 1089-1095
|
article
|
| 12 |
Inexact trust region PGC method for large sparse unconstrained optimization
|
Li, Junxiang
|
|
2010
|
51 |
3 |
p. 981-999
|
article
|
| 13 |
New dominance rules and exploration strategies for the 1|ri|∑Ui scheduling problem
|
Kao, Gio K.
|
|
2010
|
51 |
3 |
p. 1253-1274
|
article
|
| 14 |
Non-monotone projection gradient method for non-negative matrix factorization
|
Li, Xiangli
|
|
2010
|
51 |
3 |
p. 1163-1171
|
article
|
| 15 |
Numerical approximation of elliptic control problems with finitely many pointwise constraints
|
Casas, Eduardo
|
|
2011
|
51 |
3 |
p. 1319-1343
|
article
|
| 16 |
On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
|
Censor, Yair
|
|
2011
|
51 |
3 |
p. 1065-1088
|
article
|
| 17 |
Parameter identification in financial market models with a feasible point SQP algorithm
|
Gerlich, F.
|
|
2010
|
51 |
3 |
p. 1137-1161
|
article
|
| 18 |
Path-following for optimal control of stationary variational inequalities
|
Kunisch, Karl
|
|
2011
|
51 |
3 |
p. 1345-1373
|
article
|
| 19 |
Reconstructing a matrix from a partial sampling of Pareto eigenvalues
|
Gajardo, Pedro
|
|
2011
|
51 |
3 |
p. 1119-1135
|
article
|
| 20 |
Two complexity results on c-optimality in experimental design
|
Černý, Michal
|
|
2010
|
51 |
3 |
p. 1397-1408
|
article
|
| 21 |
Using approximate secant equations in limited memory methods for multilevel unconstrained optimization
|
Gratton, Serge
|
|
2011
|
51 |
3 |
p. 967-979
|
article
|
Journal description