| 1 | -- | 2 | Walid Ben-Ameur, Luis Gouveia. Preface |
| 3 | -- | 16 | Filipe Alvelos, José M. Valério de Carvalho. An extended model and a column generation algorithm for the planar multicommodity flow problem |
| 17 | -- | 28 | Alper Atamtürk, Oktay Günlük. Network design arc set with variable upper bounds |
| 29 | -- | 36 | Andreas Bley. Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths |
| 37 | -- | 49 | Mustapha Bouhtou, Guillaume Erbs, Michel Minoux. Joint optimization of pricing and resource allocation in competitive telecommunications networks |
| 50 | -- | 54 | Chandra Chekuri, F. Bruce Shepherd, G. Oriolo, Maria Grazia Scutellá. Hardness of robust network design |
| 55 | -- | 66 | Alexandre Salles da Cunha, Abilio Lucena. Lower and upper bounds for the degree-constrained minimum spanning tree problem |
| 67 | -- | 76 | Dalila B. M. M. Fontes, José Fernando Gonçalves. Heuristic solutions for general concave minimum cost network flow problems |
| 77 | -- | 85 | Jeff Hartline, Alexa Sharp. Incremental flow |
| 86 | -- | 91 | Hovhannes A. Harutyunyan, Calin D. Morosan. On the minimum path problem in Knödel graphs |
| 92 | -- | 108 | Gilbert Laporte, Inmaculada Rodríguez Martín. Locating a cycle in a transportation or a telecommunications network |
| 109 | -- | 117 | Benoit Lardeux, Dritan Nace, Jérôme Geffard. Multiperiod network design with incremental routing |
| 118 | -- | 126 | Guang Xu, Yang Yang, Jinhui Xu. Linear time algorithms for approximating the facility terminal cover problem |