| 213 | -- | 235 | Marco Antonio Boschetti, Stefano Novellani. Last-mile delivery with drone and lockers |
| 236 | -- | 255 | Georg E. A. Froehlich, Margaretha Gansterer, Karl F. Doerner. A rolling horizon framework for the time-dependent multi-visit dynamic safe street snow plowing problem |
| 256 | -- | 288 | Bernard Fortz, Mariusz Mycek, Michal Pióro, Artur Tomaszewski. Min-max optimization of node-targeted attacks in service networks |
| 289 | -- | 299 | Nadine Friesen, Tim Sander, Christina Büsing, Karl Nachtigall, Nils Nießen. The complexity of the timetable-based railway network design problem |
| 300 | -- | 323 | Yun He, Mike Hewitt, Fabien Lehuédé, Juliette Medina, Olivier Péton. A continuous-time service network design and vehicle routing problem |
| 324 | -- | 347 | Julien Khamphousone, Fabián Castaño, André Rossi, Sonia Toubaline. A survivable variant of the ring star problem |
| 348 | -- | 367 | Pengfei He, Jin-Kao Hao, Qinghua Wu 0002. p-median problem |
| 368 | -- | 389 | Guillaume Ducoffe . Balancing graph Voronoi diagrams with one more vertex |
| 390 | -- | 407 | Pedro H. Fernandes da Silva, Hervé Kerivin, Juan Pablo Nant, Annegret Katrin Wagler. Solving the routing and spectrum assignment problem, driven by combinatorial properties |
| 408 | -- | 427 | David Pisinger, Siv Sørensen. Topology reconstruction using time series data in telecommunication networks |
| 428 | -- | 467 | Michal Pióro, Mariusz Mycek, Artur Tomaszewski, Amaro de Sousa. Maximizing SDN resilience to node-targeted attacks through joint optimization of the primary and backup controllers placements |