| 169 | -- | 170 | Bernard Fortz, Luis Gouveia. Editorial |
| 171 | -- | 180 | Tolga Bektas, Mervat Chouman, Teodor Gabriel Crainic. Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints |
| 181 | -- | 186 | Gary Gordon, Ekaterina Jager. Distinguished vertices in probabilistic rooted graphs |
| 187 | -- | 193 | Abdel Lisser, Rafael Lopez. Application of semi definite relaxation and variable neighborhood search for multiuser detection in synchronous CDMA |
| 194 | -- | 204 | Yuri Frota, Nelson Maculan, Thiago F. Noronha, Celso C. Ribeiro. A branch-and-cut algorithm for partition coloring |
| 205 | -- | 220 | Si Chen, Ivana Ljubic, S. Raghavan. The regenerator location problem |
| 221 | -- | 233 | Antonio Capone, Giuliana Carello, Ilario Filippini, Stefano Gualandi, Federico Malucelli. Solving a resource allocation problem in wireless mesh networks: A comparison between a CP-based and a classical column generation |
| 234 | -- | 246 | Géraldine Heilporn, Martine Labbé, Patrice Marcotte, Gilles Savard. A polyhedral study of the network pricing problem with connected toll arcs |
| 247 | -- | 255 | Giulia Galbiati, Stefano Gualandi, Francesco Maffioli. Computational experience with a SDP-based algorithm for maximum cut with limited unbalance |
| 256 | -- | 275 | Bin Hu, Markus Leitner, Günther R. Raidl. The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search |
| 276 | -- | 286 | Sebastian Orlowski, Roland Wessäly, Michal Pióro, Artur Tomaszewski. SNDlib 1.0 - Survivable Network Design Library |
| 287 | -- | 297 | Song Guo, Victor C. M. Leung. Exact and performance-guaranteed multicast algorithms for lifetime optimization in WANETs |