| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
|
Kobayashi, Ken
|
|
|
75 |
2 |
p. 493-513
|
artikel
|
| 2 |
A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs
|
Bettiol, Enrico
|
|
|
75 |
2 |
p. 321-360
|
artikel
|
| 3 |
A line search exact penalty method for nonlinear semidefinite programming
|
Zhao, Qi
|
|
|
75 |
2 |
p. 467-491
|
artikel
|
| 4 |
A self-adaptive method for pseudomonotone equilibrium problems and variational inequalities
|
Yang, Jun
|
|
|
75 |
2 |
p. 423-440
|
artikel
|
| 5 |
Empirical study of exact algorithms for the multi-objective spanning tree
|
Fernandes, I. F. C.
|
|
|
75 |
2 |
p. 561-605
|
artikel
|
| 6 |
Fast feasibility check of the multi-material vertical alignment problem in road design
|
Monnet, Dominique
|
|
|
75 |
2 |
p. 515-536
|
artikel
|
| 7 |
Optimally linearizing the alternating direction method of multipliers for convex programming
|
He, Bingsheng
|
|
|
75 |
2 |
p. 361-388
|
artikel
|
| 8 |
Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms
|
Alves, M. Marques
|
|
|
75 |
2 |
p. 389-422
|
artikel
|
| 9 |
Secant update version of quasi-Newton PSB with weighted multisecant equations
|
Boutet, Nicolas
|
|
|
75 |
2 |
p. 441-466
|
artikel
|
| 10 |
Solution methods for a min–max facility location problem with regional customers considering closest Euclidean distances
|
Dolu, Nazlı
|
|
|
75 |
2 |
p. 537-560
|
artikel
|
Tijdschrift beschrijving