| 1 | -- | 3 | Silvano Martello, Erwin Pesch. Logistics: From theory to application (ECCO XIV) |
| 4 | -- | 29 | Andreas Klose, Andreas Drexl. Facility location models for distribution system design |
| 30 | -- | 44 | Samad Ahmadi, Ibrahim H. Osman. Greedy random adaptive memory programming search for the capacitated clustering problem |
| 45 | -- | 54 | Jinliang Cheng, Wieslaw Kubiak. A half-product based approximation scheme for agreeably weighted completion time variance |
| 55 | -- | 69 | Marie-Christine Costa, Lucas Létocart, Frédéric Roupin. Minimal multicut and maximal integer multiflow: A survey |
| 70 | -- | 82 | Paolo Dell Olmo, Monica Gentili, Andrea Scozzari. On finding dissimilar Pareto-optimal paths |
| 83 | -- | 98 | Ming Dong, F. Frank Chen. Performance modeling and analysis of integrated logistic chains: An analytic framework |
| 99 | -- | 111 | Johann Hurink, Sigrid Knust. Tabu search algorithms for job-shop problems with a single transport robot |
| 112 | -- | 121 | Adam Janiak, Mikhail Y. Kovalyov, Marie-Claude Portmann. Single machine group scheduling with resource dependent setup and processing times |
| 122 | -- | 125 | Marco E. Lübbecke. Dual variable based fathoming in dynamic programs for column generation |
| 126 | -- | 141 | Gabor Nagy, Said Salhi. Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries |
| 142 | -- | 152 | Jorge Riera-Ledesma, Juan José Salazar González. A heuristic approach for the Travelling Purchaser Problem |
| 153 | -- | 172 | Shaojun Wang, Bhaba R. Sarker. An assembly-type supply chain system controlled by kanbans under a just-in-time delivery policy |
| 173 | -- | 183 | Ching-Fang Liaw. Scheduling preemptive open shops to minimize total tardiness |
| 184 | -- | 190 | Fariborz Jolai. Minimizing number of tardy jobs on a batch processing machine with incompatible job families |
| 191 | -- | 205 | Balram Avittathur, Janat Shah, Omprakash K. Gupta. Distribution centre location modelling for differential sales tax structure |
| 206 | -- | 219 | Leonora Bianchi, Joshua D. Knowles, Neill Bowler. Local search for the probabilistic traveling salesman problem: Correction to the 2-p-opt and 1-shift algorithms |
| 220 | -- | 238 | Jörg Homberger, Hermann Gehring. A two-phase hybrid metaheuristic for the vehicle routing problem with time windows |
| 239 | -- | 250 | Susan Howick. Using system dynamics models with litigation audiences |
| 251 | -- | 269 | Stef Tijs, Ana Meca, Marco A. López. Benefit sharing in holding situations |
| 270 | -- | 280 | Tamás Solymosi, T. E. S. Raghavan, Stef Tijs. Computing the nucleolus of cyclic permutation games |
| 281 | -- | 289 | Eric Angel, Evripidis Bampis. A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem |