| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A dynamical neural network approach for distributionally robust chance-constrained Markov decision process
|
Xia, Tian
|
|
|
67 |
6 |
p. 1395-1418
|
artikel
|
| 2 |
Alleviating limit cycling in training GANs with an optimization technique
|
Li, Keke
|
|
|
67 |
6 |
p. 1287-1316
|
artikel
|
| 3 |
A neural branch-and-price for truck scheduling in cross-docks
|
Monemi, Rahimeh Neamatian
|
|
|
67 |
6 |
p. 1341-1358
|
artikel
|
| 4 |
A unified pre-training and adaptation framework for combinatorial optimization on graphs
|
Zeng, Ruibin
|
|
|
67 |
6 |
p. 1439-1456
|
artikel
|
| 5 |
Enhancing cut selection through reinforcement learning
|
Wang, Shengchao
|
|
|
67 |
6 |
p. 1377-1394
|
artikel
|
| 6 |
Gradient-based algorithms for multi-objective bi-level optimization
|
Yang, Xinmin
|
|
|
67 |
6 |
p. 1419-1438
|
artikel
|
| 7 |
Learning to optimize: A tutorial for continuous and mixed-integer optimization
|
Chen, Xiaohan
|
|
|
67 |
6 |
p. 1191-1262
|
artikel
|
| 8 |
Learning to sample initial solution for solving 0–1 discrete optimization problem by local search
|
Liu, Xin
|
|
|
67 |
6 |
p. 1317-1340
|
artikel
|
| 9 |
Learning to select the recombination operator for derivative-free optimization
|
Zhang, Haotian
|
|
|
67 |
6 |
p. 1457-1480
|
artikel
|
| 10 |
NeuroPrim: An attention-based model for solving NP-hard spanning tree problems
|
Shi, Yuchen
|
|
|
67 |
6 |
p. 1359-1376
|
artikel
|
| 11 |
Optimal pivot path of the simplex method for linear programming based on reinforcement learning
|
Li, Anqi
|
|
|
67 |
6 |
p. 1263-1286
|
artikel
|
| 12 |
Preface
|
Chen, Zhiping
|
|
|
67 |
6 |
p. 1189-1190
|
artikel
|
Tijdschrift beschrijving