Networks, Volume 51

Volume 51, Number 1, January 2008

Giorgio Gallo, Maria Grazia Scutellà:
Foreword. 1-3
Michel Gendreau, Manuel Iori, Gilbert Laporte, Silvano Martello:
A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. 4-18
Martine Labbé, Hande Yaman:
Solving the hub location problem in a star-star network. 19-33
Christophe Duhamel, Luis Gouveia, Pedro Moura, Mauricio Souza:
Models and heuristics for a minimum arborescence problem. 34-47
Krishna C. Jha, Ravindra K. Ahuja, Güvenç Sahin:
New approaches for solving the block-to-train assignment problem. 48-62
Agustín Bompadre, James B. Orlin:
A simple method for improving the primal simplex method for the multicommodity flow problem. 63-77
Nicola Apollonio, Isabella Lari, Federica Ricca, Bruno Simeone, Justo Puerto:
Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs. 78-89

Bruce L. Golden, Douglas R. Shier:
Editorial: 2006 Glover-Klingman Prize winners. 91
Sun-Yuan Hsieh:
Some edge-fault-tolerant properties of the folded hypercube. 92-101
Maria Grazia Scutellà:
The maximum congested cut problem and its robust counterpart: Exact and approximation algorithms for the single and the multicommodity case. 102-112
Jan van den Heuvel, Matthew Johnson:
Transversals of subtree hypergraphs and the source location problem in digraphs. 113-119
Illya V. Hicks:
New facets for the planar subgraph polytope. 120-132
Mauricio C. de Souza, Philippe Mahey, Bernard Gendron:
Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs. 133-141
Hayri Önal, Yicheng Wang:
A graph theory approach for designing conservation reserve networks with minimal fragmentation. 142-152
Michel Gendreau, Manuel Iori, Gilbert Laporte, Silvano Martello:
Erratum: A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. 153

Giovanni Righini, Matteo Salani:
New dynamic programming algorithms for the resource constrained elementary shortest path problem. 155-170
Cheng-Nan Lai, Gen-Huey Chen:
w-Rabin numbers and strong w-Rabin numbers of folded hypercubes. 171-177
Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger:
The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases. 178-189
Alok Baveja:
The fractional congestion bound for efficient edge disjoint routing. 190-199
Shiying Wang, Shangwei Lin:
Sufficient conditions for a graph to be super restricted edge-connected. 200-209

Aurel Cami, Narsingh Deo:
Techniques for analyzing dynamic random graph models of web-like networks: An overview. 211-255
Cédric Bentz, Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries:
On a graph coloring problem arising from discrete tomography. 256-267