| 3361 | -- | 3362 | Gianpaolo Ghiani, Roberto Musmanno. Recent algorithmic advances for Arc Routing Problems |
| 3363 | -- | 3383 | José-Manuel Belenguer, Enrique Benavent, Philippe Lacomme, Christian Prins. Lower and upper bounds for the mixed capacitated arc routing problem |
| 3384 | -- | 3402 | Angel Corberán, Enrique Mota, José M. Sanchis. A comparison of two different formulations for arc routing problems on mixed graphs |
| 3403 | -- | 3422 | Dino Ahr, Gerhard Reinelt. A tabu search algorithm for the min-max ::::k::::-Chinese postman problem |
| 3423 | -- | 3431 | U. F. Aminu, Richard W. Eglese. A constraint programming approach to the Chinese postman problem with time windows |
| 3432 | -- | 3449 | Julián Aráoz, Elena Fernández, Cristina Zoltan. Privatized rural postman problems |
| 3450 | -- | 3457 | Gianpaolo Ghiani, Demetrio Laganà, Roberto Musmanno. A constructive heuristic for the Undirected Rural Postman Problem |
| 3458 | -- | 3472 | Sanne Wøhlk. New lower bound for the Capacitated Arc Routing Problem |
| 3473 | -- | 3493 | Philippe Lacomme, Christian Prins, Marc Sevaux. A genetic algorithm for a bi-objective capacitated arc routing problem |
| 3494 | -- | 3507 | Fabien Marzolf, Martin Trépanier, André Langevin. Road network monitoring: algorithms and a case study |
| 3508 | -- | 3519 | Richard W. Eglese, Will Maden, Alan Falconer Slater. A Road Timetable:::TM::: to aid vehicle routing and scheduling |
| 3520 | -- | 3534 | Fernando C. Gomes, Cláudio Nogueira de Meneses, Panos M. Pardalos, Gerardo Valdisio R. Viana. Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Problems |
| 3535 | -- | 3548 | Ernesto G. Birgin, José Mario Martínez, F. H. Nishihara, Débora P. Ronconi. Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization |
| 3549 | -- | 3565 | Carlos G. Garcia, Dionisio Pérez-Brito, Vicente Campos, Rafael Martí. Variable neighborhood search for the linear ordering problem |
| 3566 | -- | 3582 | Yoshiaki Ohsawa, Frank Plastria, Kazuki Tamura. Euclidean push-pull partial covering problems |
| 3583 | -- | 3599 | Wilco van den Heuvel, Albert P. M. Wagelmans. An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem |
| 3600 | -- | 3623 | Nafee Rizk, Alain Martel, Sophie D Amours. Multi-item dynamic production-distribution planning in process industries with divergent finishing stages |
| 3624 | -- | 3642 | Byung-In Kim, Seongbae Kim, Surya Sahoo. Waste collection vehicle routing problem with time windows |