| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A gradient-based method to calculate (s,S) policies
|
Dai, Weimin
|
|
|
51 |
4 |
p. 468-473
|
article
|
| 2 |
An FPTAS for scheduling with resource constraints
|
Chen, Bo
|
|
|
51 |
4 |
p. 421-424
|
article
|
| 3 |
A study of lattice reformulations for integer programming
|
Aardal, Karen
|
|
|
51 |
4 |
p. 401-407
|
article
|
| 4 |
Complete rent dissipation in contest with power technologies
|
Kawamori, Tomohiko
|
|
|
51 |
4 |
p. 453-455
|
article
|
| 5 |
Continuous cutting plane algorithms in integer programming
|
Chételat, Didier
|
|
|
51 |
4 |
p. 439-445
|
article
|
| 6 |
Convergence analysis of a subsampled Levenberg-Marquardt algorithm
|
Xing, Ganchen
|
|
|
51 |
4 |
p. 379-384
|
article
|
| 7 |
Data-driven hedging of stock index options via deep learning
|
Chen, Jie
|
|
|
51 |
4 |
p. 408-413
|
article
|
| 8 |
Editorial Board
|
|
|
|
51 |
4 |
p. ii
|
article
|
| 9 |
Evaluating mixed-integer programming models over multiple right-hand sides
|
Alfant, Rachael M.
|
|
|
51 |
4 |
p. 414-420
|
article
|
| 10 |
On data reduction for dynamic vector bin packing
|
van Bevern, René
|
|
|
51 |
4 |
p. 446-452
|
article
|
| 11 |
Risk-averse stochastic optimal control: An efficiently computable statistical upper bound
|
Guigues, Vincent
|
|
|
51 |
4 |
p. 393-400
|
article
|
| 12 |
Stochastic joint replenishment problem under a fill rate constraint with controllable lead times and shared cost allocation
|
Castellano, Davide
|
|
|
51 |
4 |
p. 385-392
|
article
|
| 13 |
Supply chain coordination by manufacturer reward contract
|
Zhang, Yuxiang
|
|
|
51 |
4 |
p. 432-438
|
article
|
| 14 |
The non-Markovian nature of nested logit choice
|
Li, Selena
|
|
|
51 |
4 |
p. 461-467
|
article
|
| 15 |
Truly tight bounds for TSP heuristics
|
Hurkens, Cor
|
|
|
51 |
4 |
p. 425-431
|
article
|
| 16 |
Unconstrained traveling tournament problem is APX-complete
|
Bendayan, Salomon
|
|
|
51 |
4 |
p. 456-460
|
article
|
Journal description