| 1 | -- | 14 | J. Christopher Beck, T. K. Feng, Jean-Paul Watson. Combining Constraint Programming and Local Search for Job-Shop Scheduling |
| 15 | -- | 25 | Slawomir Bak, Jacek Blazewicz, Grzegorz Pawlak, Maciej Plaza, Edmund K. Burke, Graham Kendall. A Parallel Branch-and-Bound Approach to the Rectangular Guillotine Strip Cutting Problem |
| 26 | -- | 40 | Alberto Caprara, Adam N. Letchford, Juan José Salazar González. Decorous Lower Bounds for Minimum Linear Arrangement |
| 41 | -- | 55 | Iván A. Contreras, Juan A. Díaz, Elena Fernández. Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment |
| 56 | -- | 74 | S. Raghavan, Daliborka Stanojevic. Branch and Price for WDM Optical Networks with No Bifurcation of Flow |
| 75 | -- | 89 | Aysegül Altin, Hande Yaman, Mustafa Ç. Pinar. The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations |
| 90 | -- | 104 | Marco A. Boschetti, Vittorio Maniezzo, Matteo Roffilli. A Fully Distributed Lagrangean Solution for a Peer-to-Peer Overlay Network Design Problem |
| 105 | -- | 119 | Faramroze G. Engineer, George L. Nemhauser, Martin W. P. Savelsbergh. Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem |
| 120 | -- | 137 | Maria Garcia de la Banda, Peter J. Stuckey, Geoffrey Chu. Solving Talent Scheduling with Dynamic Programming |
| 138 | -- | 152 | Zan Huang, Daniel Dajun Zeng. Why Does Collaborative Filtering Work? Transaction-Based Recommendation Model Validation and Selection by Analyzing Bipartite Random Graphs |
| 153 | -- | 164 | Qi-Ming He, Hanqin Zhang, Jungong Xue. Algorithms for Coxianization of Phase-Type Generators |
| 165 | -- | 171 | Benny Van Houdt, Johan van Leeuwaarden. Triangular M/G/1-Type and Tree-Like Quasi-Birth-Death Markov Chains |