| 1 | -- | 4 | Cor A. J. Hurkens, Gerhard J. Woeginger. On the nearest neighbor rule for the traveling salesman problem |
| 5 | -- | 14 | Alberto Caprara, Michele Monaci. On the two-dimensional Knapsack Problem |
| 15 | -- | 22 | Geir Dahl, Luis Gouveia. On the directed hop-constrained shortest path problem |
| 23 | -- | 26 | Tamás Fleiner, András Frank, Satoru Iwata. A constrained independent set problem for matroids |
| 27 | -- | 30 | Abraham P. Punnen, Yash P. Aneja. Lexicographic balanced optimization problems |
| 31 | -- | 35 | Akiyoshi Shioura. The MA-ordering max-flow algorithm is not strongly polynomial for directed networks |
| 36 | -- | 40 | Ionut D. Aron, Pascal Van Hentenryck. On the complexity of the robust spanning tree problem with interval data |
| 41 | -- | 43 | Maxim Sviridenko. A note on maximizing a submodular set function subject to a knapsack constraint |
| 44 | -- | 48 | Ahmet B. Keha, Ismael R. de Farias Jr., George L. Nemhauser. Models for representing piecewise linear cost functions |
| 49 | -- | 58 | Dorit S. Hochbaum. Monotonizing linear programs with up to two nonzeroes per column |
| 59 | -- | 67 | András Prékopa, Xiaoling Hou. A stochastic programming model to find optimal sample sizes to estimate unknown parameters in an LP |
| 68 | -- | 72 | Andrea Grosso, Federico Della Croce, Roberto Tadei. An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem |
| 73 | -- | 76 | Adam Wierman, Nikhil Bansal, Mor Harchol-Balter. A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues |
| 77 | -- | 84 | Zhe George Zhang, Naishuo Tian. The ::::N:::: threshold policy for the ::::GI::::/::::M::::/1 queue |
| 85 | -- | 93 | Bong Dae Choi, Bara Kim, Gang Uk Hwang, Jae-kyoon Kim. The analysis of a multiserver queue fed by a discrete autoregressive process of order 1 |
| 94 | -- | 98 | Jens Leth Hougaard, Hans Keiding. Continuous benchmark selections |