| 1 | -- | 8 | Alexander Shapiro. On complexity of multistage stochastic programs |
| 9 | -- | 16 | Derek E. Armstrong, Sheldon H. Jacobson. Order preserving reductions and polynomial improving paths |
| 17 | -- | 21 | Olivier Gossner, Penélope Hernández. Coordination through De Bruijn sequences |
| 22 | -- | 28 | Pedro C. Calleja, Arantza Estévez-Fernández, Peter Borm, Herbert Hamers. Job scheduling, cooperation, and control |
| 29 | -- | 36 | Nihat Kasap, Haldun Aytug, Anand Paul. Minimizing makespan on a single machine subject to random breakdowns |
| 37 | -- | 40 | T. C. Edwin Cheng, Yong He, Han Hoogeveen, Min Ji, Gerhard J. Woeginger. Scheduling with step-improving processing times |
| 41 | -- | 45 | Özlem Ergun, James B. Orlin. Fast neighborhood search for the single machine total weighted tardiness problem |
| 46 | -- | 48 | Anand Paul. On the unimodality of the manufacturer s objective function in the newsvendor model |
| 49 | -- | 52 | José E. Valdés, Rómulo I. Zequeira. On the optimal allocation of two active redundancies in a two-component series system |
| 53 | -- | 57 | Donglei Du, Santosh N. Kabadi. An improved algorithm for decomposing arc flows into multipath flows |
| 58 | -- | 68 | Natashia Boland, John Dethridge, Irina Dumitrescu. Accelerated label setting algorithms for the elementary resource constrained shortest path problem |
| 69 | -- | 76 | Adam Kasperski, Pawel Zielinski. The robust shortest path problem in series-parallel multidigraphs with interval data |
| 77 | -- | 84 | Anna Galluccio, Paolo Nobili. Improved approximation of maximum vertex cover |
| 85 | -- | 93 | José R. Correa. Resource augmentation in two-dimensional packing with orthogonal rotations |
| 94 | -- | 96 | Nicolai N. Pisaruk. A 2-approximation algorithm for the network substitution problem |
| 97 | -- | 105 | Arie Tamir. Locating two obnoxious facilities using the weighted maximin criterion |
| 106 | -- | 110 | Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger. The traveling salesman problem with few inner points |
| 111 | -- | 120 | Snezana Mitrovic-Minic, Ramesh Krishnamurti. The multiple TSP with time windows: vehicle bounds based on precedence graphs |