| 1 | -- | 0 | . From the Editor |
| 2 | -- | 0 | . Institute for Operations Research and the Management Sciences: Board of Directors and Editors for 2005 |
| 3 | -- | 9 | Eric L. Savage, Lee Schruben, Enver Yücesan. On the Generality of Event-Graph Models |
| 10 | -- | 24 | Teodor Gabriel Crainic, Federico Malucelli, Maddalena Nonato, François Guertin. Meta-Heuristics for a Class of Demand-Responsive Transit Systems |
| 25 | -- | 31 | W. Nick Street. Oblique Multicategory Decision Trees Using Nonlinear Programming |
| 32 | -- | 51 | Siwate Rojanasoonthon, Jonathan Bard. A GRASP for Parallel Machine Scheduling with Time Windows |
| 52 | -- | 65 | Sophie Demassey, Christian Artigues, Philippe Michelon. Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem |
| 66 | -- | 74 | Michael Tortorella. Numerical Solutions of Renewal-Type Integral Equations |
| 75 | -- | 81 | Dae W. Choi, Nam K. Kim, Kyung C. Chae. A Two-Moment Approximation for the ::::GI/G/c:::: Queue with Finite Capacity |
| 82 | -- | 98 | Paola Cappanera, Marco Trubian. A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem |
| 99 | -- | 110 | Yong Tan, Kamran Moinzadeh, Vijay S. Mookerjee. Optimal Processing Policies for an e-Commerce Web Server |
| 111 | -- | 122 | Vicente Campos, Manuel Laguna, Rafael Martí. Context-Independent Scatter and Tabu Search for Permutation Problems |
| 123 | -- | 136 | Martin W. P. Savelsbergh, R. N. Uma, Joel Wein. An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems |