| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Covering a simplex by spheres: complexity and algorithms
|
Zhang, Tongli
|
|
|
84 |
1 |
p. 119-135
|
artikel
|
| 2 |
Finding non dominated points for multiobjective integer convex programs with linear constraints
|
Zerfa, Lamia
|
|
|
84 |
1 |
p. 95-117
|
artikel
|
| 3 |
Fractional 0–1 programming and submodularity
|
Han, Shaoning
|
|
|
84 |
1 |
p. 77-93
|
artikel
|
| 4 |
On the global minimization of discretized residual functionals of conditionally well-posed inverse problems
|
Kokurin, M. Yu.
|
|
|
84 |
1 |
p. 149-176
|
artikel
|
| 5 |
Quasi-contingent derivatives and studies of higher-orders in nonsmooth optimization
|
Bao, Nguyen Xuan Duy
|
|
|
84 |
1 |
p. 205-228
|
artikel
|
| 6 |
Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors
|
Mao, Xianpeng
|
|
|
84 |
1 |
p. 229-253
|
artikel
|
| 7 |
Sufficient conditions for existence of global minimizers of functions on Hilbert spaces
|
Chen, Liang
|
|
|
84 |
1 |
p. 137-147
|
artikel
|
| 8 |
The p-Lagrangian relaxation for separable nonconvex MIQCQP problems
|
Andrade, Tiago
|
|
|
84 |
1 |
p. 43-76
|
artikel
|
| 9 |
The projected polar proximal point algorithm converges globally
|
Lindstrom, Scott B.
|
|
|
84 |
1 |
p. 177-203
|
artikel
|
| 10 |
The supporting hyperplane optimization toolkit for convex MINLP
|
Lundell, Andreas
|
|
|
84 |
1 |
p. 1-41
|
artikel
|
Tijdschrift beschrijving