| 59 | -- | 60 | Stefano Pallottino, Roberto Tadei. Foreword |
| 61 | -- | 72 | Matteo Fischetti, Carlo Polo, Massimo Scantamburlo. A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem |
| 73 | -- | 83 | Luigi De Giovanni, Federico Della Croce, Roberto Tadei. On the impact of the solution representation for the Internet Protocol Network Design Problem with max-hop constraints |
| 84 | -- | 93 | Martine Labbé, Hande Yaman. Projecting the flow variables for hub location problems |
| 94 | -- | 105 | Giuliana Carello, Federico Della Croce, Marco Ghirardi, Roberto Tadei. Solving the Hub location problem in telecommunication network design: A local search approach |
| 106 | -- | 119 | Massimiliano Caramia, Stefano Giordani, Antonio Iovanella. Grid scheduling by on-line rectangle packing |
| 120 | -- | 131 | Nicola Apollonio, Lou Caccetta, Bruno Simeone. Cardinality constrained path covering problems in grid graphs |
| 132 | -- | 141 | Claudio Arbib, Stefano Smriglio, Mara Servilio. A competitive scheduling problem and its relevance to UMTS channel assignment |
| 142 | -- | 150 | Lihui Bai, Donald W. Hearn, Siriphong Lawphongpanich. Decomposition techniques for the minimum toll revenue problem |
| 151 | -- | 159 | Alessandro Agnetis, Fabrizio Rossi, Stefano Smriglio. An implicit enumeration scheme for the batch selection problem |
| 160 | -- | 171 | Ravindra K. Ahuja, Jian Liu, James B. Orlin, Jon Goodstein, Amit Mukherjee. A neighborhood search algorithm for the combined through and fleet assignment model with time windows |