| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A best possible online algorithm for minimizing the total completion time and the total soft penalty cost
|
Ma, Ran
|
|
|
18 |
1 |
p. 319-338
|
artikel
|
| 2 |
A clustering heuristic to improve a derivative-free algorithm for nonsmooth optimization
|
Gaudioso, Manlio
|
|
|
18 |
1 |
p. 57-71
|
artikel
|
| 3 |
A local search algorithm for the k-path partition problem
|
Li, Shiming
|
|
|
18 |
1 |
p. 279-290
|
artikel
|
| 4 |
An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials
|
Guo, Feng
|
|
|
18 |
1 |
p. 105-133
|
artikel
|
| 5 |
A parallel greedy approach enhanced by genetic algorithm for the stochastic rig routing problem
|
Borisovsky, Pavel
|
|
|
18 |
1 |
p. 235-255
|
artikel
|
| 6 |
Approximation algorithms for the restricted k-Chinese postman problems with penalties
|
Pan, Pengxiang
|
|
|
18 |
1 |
p. 307-318
|
artikel
|
| 7 |
Checking weak and strong optimality of the solution to interval convex quadratic programming in a general form
|
Xia, Mengxue
|
|
|
18 |
1 |
p. 339-364
|
artikel
|
| 8 |
k-sparse vector recovery via Truncated ℓ1-ℓ2 local minimization
|
Xie, Shaohua
|
|
|
18 |
1 |
p. 291-305
|
artikel
|
| 9 |
Linear-size formulations for connected planar graph partitioning and political districting
|
Zhang, Jack
|
|
|
18 |
1 |
p. 19-31
|
artikel
|
| 10 |
Local linear convergence of proximal coordinate descent algorithm
|
Klopfenstein, Quentin
|
|
|
18 |
1 |
p. 135-154
|
artikel
|
| 11 |
On the complexity of proportionate open shop and job shop problems
|
Azerine, Abdennour
|
|
|
18 |
1 |
p. 365-375
|
artikel
|
| 12 |
Pooling adjacent violators under interval constraints
|
Kopperschmidt, Kai
|
|
|
18 |
1 |
p. 257-277
|
artikel
|
| 13 |
Structured (min,+)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems
|
Gribanov, D. V.
|
|
|
18 |
1 |
p. 73-103
|
artikel
|
| 14 |
The operator splitting schemes revisited: primal-dual gap and degeneracy reduction by a unified analysis
|
Xue, Feng
|
|
|
18 |
1 |
p. 155-194
|
artikel
|
| 15 |
The set partitioning problem in a quantum context
|
Cacao, Rafael
|
|
|
18 |
1 |
p. 1-17
|
artikel
|
| 16 |
Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms
|
Chen, Yifu
|
|
|
18 |
1 |
p. 215-234
|
artikel
|
| 17 |
Uniqueness of solutions in multivariate Chebyshev approximation problems
|
Roshchina, Vera
|
|
|
18 |
1 |
p. 33-55
|
artikel
|
| 18 |
Worst-case evaluation complexity of a derivative-free quadratic regularization method
|
Grapiglia, Geovani Nunes
|
|
|
18 |
1 |
p. 195-213
|
artikel
|
Tijdschrift beschrijving