| 1 | -- | 9 | Jean-Paul Doignon, Samuel Fiorini, Gwenaël Joret. Weighted graphs defining facets: A connection between stable set and linear ordering polytopes |
| 10 | -- | 22 | Yann Hendel, Nina Runge, Francis Sourd. The one-machine just-in-time scheduling problem with preemption |
| 23 | -- | 36 | Toshimasa Ishii. Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs |
| 37 | -- | 50 | Hiroo Saito, Tetsuya Fujie, Tomomi Matsui, Shiro Matuura. A study of the quadratic semi-assignment polytope |
| 51 | -- | 63 | Javier Marenco, Annegret Wagler. Cycle-based facets of chromatic scheduling polytopes |
| 64 | -- | 78 | Javier Marenco, Annegret Wagler. Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques |
| 79 | -- | 91 | Wieslaw Kubiak, Djamal Rebaine, Chris Potts. Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors |
| 92 | -- | 97 | Maxim A. Babenko, Alexander V. Karzanov. Minimum mean cycle problem in bidirected and skew-symmetric graphs |
| 98 | -- | 109 | Christian Liebchen, Leon Peeters. Integral cycle bases for cyclic timetabling |
| 110 | -- | 124 | Vincent Poirriez, Nicola Yanev, Rumen Andonov. A hybrid algorithm for the unbounded knapsack problem |
| 125 | -- | 133 | Sanming Zhou. Minimum partition of an independence system into independent sets |