| 123 | -- | 127 | Ismail Saglam. Two-player bargaining problems with unilateral pre-donation |
| 128 | -- | 132 | Kenjiro Takazawa. An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint |
| 133 | -- | 136 | Milos Kopa, Martin Smíd. Contractivity of Bellman operator in risk averse dynamic programming with infinite horizon |
| 137 | -- | 141 | Marin Bougeret, Artur Alves Pessoa, Michael Poss. Single machine robust scheduling with budgeted uncertainty |
| 142 | -- | 145 | Maurizio D'Andrea. Playing against no-regret players |
| 146 | -- | 152 | Aida Khajavirad. On the strength of recursive McCormick relaxations for binary polynomial optimization |
| 153 | -- | 158 | David Bartl, Miklós Pintér. On balanced games with infinitely many players: Revisiting Schmeidler's result |
| 159 | -- | 162 | Qianqian Kong, Hans Peters. Scoring indices, top-truncated preferences, and splitting invariance |
| 163 | -- | 170 | Laurens Deprez, Katrien Antonio, Joachim Arts, Robert N. Boute. Data-driven preventive maintenance for a heterogeneous machine portfolio |
| 171 | -- | 175 | Avinash Bhardwaj, Manjesh K. Hanawal, Purushottam Parthasarathy. Almost exact risk budgeting with return forecasts for portfolio allocation |
| 176 | -- | 178 | Mahmoud Affouf, Jiantian Wang. Answer to an open problem about stochastic comparison of parallel systems with geometric components |
| 179 | -- | 186 | Tim Engels, Ivo Adan, Onno J. Boxma, Jacques Resing. Exact results for the order picking time distribution under return routing |
| 187 | -- | 189 | Jan Karel Lenstra, Nodari Vakhania. On the complexity of scheduling unrelated parallel machines with limited preemptions |
| 190 | -- | 196 | Shanshan Guo, Jiayuan Han, Wenbin Wang. Business models for public emission reduction projects |
| 197 | -- | 203 | Annabella Astorino, Antonio Frangioni, Enrico Gorgone, Benedetto Manca. Ellipsoidal classification via semidefinite programming |