| 289 | -- | 305 | Pablo Adasme, Rafael Andrade, Marc Letournel, Abdel Lisser. Stochastic maximum weight forest problem |
| 306 | -- | 311 | Ashwin Arulselvan, Olaf Maurer, Martin Skutella. An incremental algorithm for the uncapacitated facility location problem |
| 312 | -- | 328 | Ralf Borndörfer, Julia Buwaya, Guillaume Sagnol, Elmar Swarat. Network spot-checking games: Theory and application to toll enforcing in transportation networks |
| 329 | -- | 343 | Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena, Bernard Gendron. Formulations and exact solution approaches for the degree preserving spanning tree problem |
| 344 | -- | 352 | Frédéric Giroire, Stéphane Pérennes, Issam Tahiri. On the complexity of equal shortest path routing |
| 353 | -- | 366 | Enrico Malaguti, Isabel Méndez-Díaz, Juan José Miranda Bront, Paula Zabala. k, c)-coloring problem |
| 367 | -- | 379 | Dilson Lucas Pereira, Michel Gendreau, Alexandre Salles da Cunha. Branch-and-cut and Branch-and-cut-and-price algorithms for the adjacent only quadratic minimum spanning tree problem |
| 380 | -- | 394 | S. Raghavan, Mustafa Sahin. Efficient Edge-swapping heuristics for the reload cost spanning tree problem |