| 521 | -- | 525 | Gengcheng Liu, Shiji Song, Cheng Wu. Some heuristics for no-wait flowshops with total tardiness criterion |
| 526 | -- | 535 | Dan Black, Richard W. Eglese, Sanne Wøhlk. The time-dependent prize-collecting arc routing problem |
| 536 | -- | 546 | Ulrich Derigs, Markus Pullmann, Ulrich Vogel. Truck and trailer routing - Problems, heuristics and computational experience |
| 547 | -- | 557 | Ji-Bo Wang, Ming-Zheng Wang. Minimizing makespan in three-machine flow shops with deteriorating jobs |
| 558 | -- | 565 | Leandro C. Coelho, Gilbert Laporte. The exact solution of several classes of inventory-routing problems |
| 566 | -- | 583 | Jorge Riera-Ledesma, Juan José Salazar González. A column generation approach for a school bus routing problem with resource constraints |
| 584 | -- | 593 | Fabio Colombo, Marco Trubian. A branch and price algorithm for the SS/TDMA problem with cardinality constraint |
| 594 | -- | 602 | Lei Fang, Hecheng Li. Duality and efficiency computations in the cost efficiency model with price uncertainty |
| 603 | -- | 615 | Rym M'Hallah, Abdulaziz Alkandari, Nenad Mladenovic. Packing unit spheres into the smallest sphere using VNS and NLP |
| 616 | -- | 626 | Antonio Sedeño-Noda, Juan José Espino-Martín. On the K best integer network flows |
| 627 | -- | 632 | Xingye Dong, Ping Chen, Houkuan Huang, Maciek Nowak. A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time |
| 633 | -- | 638 | Liangjun Ke, Zuren Feng. A two-phase metaheuristic for the cumulative capacitated vehicle routing problem |
| 639 | -- | 653 | Zeynep Uruk, Hakan Gultekin, M. Selim Akturk. Two-machine flowshop scheduling with flexible operations and controllable processing times |