| 233 | -- | 240 | Kun Meng, Chuang Lin, Yang Yang. Minimum number of queries for an adaptive liar search game with small sets |
| 241 | -- | 250 | Christophe Rapine, Nadia Brauner. A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times |
| 251 | -- | 262 | Pierre Baptiste, Alain Hertz, André Linhares, Djamal Rebaine. A polynomial time algorithm for unloading boxes off a gravity conveyor |
| 263 | -- | 295 | Claudio Contardo, Jean-François Cordeau, Bernard Gendron. A computational comparison of flow formulations for the capacitated location-routing problem |
| 296 | -- | 303 | Flavia Bonomo, Denis Cornaz, Tinaz Ekim, Bernard Ries. Perfectness of clustered graphs |
| 304 | -- | 309 | Vadim V. Lozin, Raffaele Mosca, Christopher Purcell. 3-free graphs |
| 310 | -- | 319 | Sven Herrmann, Vincent Moulton, Andreas Spillner 0001. Searching for realizations of finite metric spaces in tight spans |
| 320 | -- | 330 | Mhand Hifi, Hedi M'halla. Sensitivity analysis to perturbations of the weight of a subset of items: The knapsack case study |
| 331 | -- | 332 | Noriyoshi Sukegawa, Atsushi Miyauchi. A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number |
| 333 | -- | 360 | Refael Hassin, Ohad Schneider. A local search algorithm for binary maximum 2-path partitioning |
| 361 | -- | 370 | Chandrashekhar Nagarajan, David P. Williamson. Offline and online facility leasing |
| 371 | -- | 382 | Takuro Fukunaga. Computing minimum multiway cuts in hypergraphs |