| 153 | -- | 157 | Joey Fung, Yakov Zinder. Permutation schedules for a two-machine flow shop with storage |
| 158 | -- | 164 | Jean B. Lasserre. A MAX-CUT formulation of 0/1 programs |
| 165 | -- | 169 | Stephen Pallone, Peter I. Frazier, Shane G. Henderson. Coupled bisection for root ordering |
| 170 | -- | 173 | Matthias Walter, Pelin Damci-Kurt, Santanu S. Dey, Simge Küçükyavuz. On a cardinality-constrained transportation problem with market choice |
| 174 | -- | 176 | Chao Xu. Reconstructing edge-disjoint paths faster |
| 177 | -- | 179 | Pham Huu Sach. Connectedness in vector equilibrium problems involving cones with possibly empty interior |
| 180 | -- | 185 | Jiajin Yu, Shabbir Ahmed. Maximizing expected utility over a knapsack constraint |
| 186 | -- | 190 | Nha-Nghi de la Cruz, Hans Daduna. Monotonicity of base stock policies |
| 191 | -- | 195 | Neil Olver. A note on hierarchical hubbing for a generalization of the VPN problem |
| 196 | -- | 198 | Moshe Haviv, Binyamin Oz. Regulating an observable M/M/1 queue |
| 199 | -- | 201 | Thomas Knecht, Dieter Jungnickel. A note on the k-minimum spanning tree problem on circles |
| 202 | -- | 207 | Eduard Kromer, Ludger Overbeck. p spaces |
| 208 | -- | 211 | Gustavo Bergantiños, Juan D. Moreno-Ternero. A new rule for the problem of sharing the revenue from museum passes |
| 212 | -- | 218 | A. Chunxiang, Zhongfei Li, Fan Wang. Optimal investment strategy under time-inconsistent preferences and high-water mark contract |
| 219 | -- | 224 | Rajeev R. Tripathi, R. K. Amit. Equivalence nucleolus for coalitional games with externalities |
| 225 | -- | 230 | Luis Rademacher, Alejandro Toriello, Juan Pablo Vielma. On packing and covering polyhedra in infinite dimensions |
| 231 | -- | 233 | Winston W. Chang, Tai-Liang Chen. Tridiagonal matrices with dominant diagonals and applications |
| 234 | -- | 237 | Gerardo Berbeglia. Discrete choice models based on random walks |
| 238 | -- | 242 | Moutaz Khouja. Forward-buying and the naive newsvendor |
| 243 | -- | 249 | Roberto Cañavate, Mercedes Landete. A polyhedral study on 0-1 knapsack problems with set packing constraints |
| 250 | -- | 254 | Dmitriy Kvasov. On sabotage games |
| 255 | -- | 259 | Franklin H. J. Kenter. Approximating the minimum rank of a graph via alternating projection |
| 260 | -- | 266 | Thai Doan Chuong. Nondifferentiable fractional semi-infinite multiobjective optimization problems |
| 267 | -- | 272 | Romain Hollanders, Balázs Gerencsér, Jean-Charles Delvenne, Raphaël M. Jungers. Improved bound on the worst case complexity of Policy Iteration |
| 273 | -- | 277 | Leah Epstein. More on batched bin packing |
| 278 | -- | 284 | Marcello Braglia, Davide Castellano, Mosè Gallo. An extension of the stochastic Joint-Replenishment Problem under the class of cyclic policies |
| 285 | -- | 289 | Martin Branda, Milos Kopa. DEA models equivalent to general Nth order stochastic dominance efficiency tests |