| 299 | -- | 306 | Andrew E. B. Lim, Poomyos Wimonkittiwat. Dynamic portfolio selection with market impact costs |
| 307 | -- | 310 | Gábor Braun, Sebastian Pokutta. A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set |
| 311 | -- | 318 | Ward Whitt. t/m/∞ queue with a sinusoidal arrival rate function |
| 319 | -- | 324 | Guang Li, Paat Rusmevichientong. A greedy algorithm for the two-level nested logit model |
| 325 | -- | 331 | Ji Hwan Cha, Maxim Finkelstein. On some conditional characteristics of hazard rate processes induced by external shocks |
| 332 | -- | 336 | Shmuel Wimer, Doron Gluzer, Uri Wimer. Using well-solvable minimum cost exact covering for VLSI clock energy minimization |
| 337 | -- | 342 | Yang Shen, Xin Zhang 0012, Tak Kuen Siu. Mean-variance portfolio selection under a constant elasticity of variance model |
| 343 | -- | 347 | Oscar C. Vásquez. On the complexity of the single machine scheduling problem minimizing total weighted delay penalty |
| 348 | -- | 350 | Lin Chen, Deshi Ye, Guochuan Zhang. An improved lower bound for rank four scheduling |
| 351 | -- | 354 | Ngo Dac Tan. Vertex disjoint cycles of different lengths in d-arc-dominated digraphs |
| 355 | -- | 360 | Mauro Castelli, Leonardo Vanneschi. Genetic algorithm with variable neighborhood search for the optimal allocation of goods in shop shelves |
| 361 | -- | 366 | Kazuo Murota, Akiyoshi Shioura. Exact bounds for steepest descent algorithms of L-convex function minimization |
| 367 | -- | 373 | Retsef Levi, Georgia Perakis, Gonzalo Romero. A continuous knapsack problem with separable convex utilities: Approximation algorithms and applications |
| 374 | -- | 377 | Uladzimir Rubasheuski, Johan Oppen, David L. Woodruff. Multi-stage scenario generation by the combined moment matching and scenario reduction method |