| 343 | -- | 355 | Gerardo Berbeglia, Jean-François Cordeau, Gilbert Laporte. A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem |
| 356 | -- | 371 | Roberto Baldacci, Aristide Mingozzi, Roberto Roberti. New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows |
| 372 | -- | 386 | Yinghui (Catherine) Yang, Balaji Padmanabhan, Hongyan Liu, Xiaoyu Wang. Discovery of Periodic Patterns in Sequence Data: A Variance-Based Approach |
| 387 | -- | 398 | Mohammad M. Fazel-Zarandi, J. Christopher Beck. Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem |
| 399 | -- | 415 | Renata Mansini, Maria Grazia Speranza. CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem |
| 416 | -- | 432 | Xue Bai, Ram D. Gopal, Manuel A. Nunez, Dmitry Zhdanov. On the Prevention of Fraud and Privacy Exposure in Process Information Flow |
| 433 | -- | 442 | Edward C. Sewell, Sheldon H. Jacobson. A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem |
| 443 | -- | 456 | Xiangyong Li, Yash P. Aneja. A Branch-and-Cut Approach for the Minimum-Energy Broadcasting Problem in Wireless Networks |
| 457 | -- | 470 | Sam D. Allen, Edmund K. Burke. Data Structures for Higher-Dimensional Rectilinear Packing |
| 471 | -- | 484 | Gabriella Dellino, Jack P. C. Kleijnen, Carlo Meloni. Robust Optimization in Simulation: Taguchi and Krige Combined |
| 485 | -- | 499 | Fabrice Talla Nobibon, Cor A. J. Hurkens, Roel Leus, Frits C. R. Spieksma. Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles |
| 500 | -- | 515 | Simon A. Spacey, Wolfram Wiesemann, Daniel Kuhn, Wayne Luk. Robust Software Partitioning with Multiple Instantiation |