Networks, Volume 50

Volume 50, Number 1, August 2007

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

Volume 50, Number 2, September 2007

• Oded Berman, Jiamin Wang:
  The 1-minimax and 1-maximin problems with demand weights of general probability distributions. 127-135
  Electronic Edition (link) BibTeX
• Fernando Ordóñez, Jiamin Zhao:
  Robust capacity expansion of network flows. 136-145
  Electronic Edition (link) BibTeX
• Yuan-Hsiang Teng, Jimmy J. M. Tan, Lih-Hsing Hsu:
  Panpositionable hamiltonicity of the alternating group graphs. 146-156
  Electronic Edition (link) BibTeX
• Ning Shi, Raymond K. Cheung, Haiqing Song:
  On stochastic programs over trees with partially dependent arc capacities. 157-163
  Electronic Edition (link) BibTeX
• Toni R. Farley, Charles J. Colbourn:
  Multiterminal resilience for series-parallel networks. 164-172
  Electronic Edition (link) BibTeX
• Eddie Cheng, László Lipták:
  Matching preclusion for some interconnection networks. 173-180
  Electronic Edition (link) BibTeX

Volume 50, Number 3, October 2007

• Donglei Du, R. Chandrasekaran:
  The maximum residual flow problem: NP-hardness with two-arc destruction. 181-182
  Electronic Edition (link) BibTeX
• Karen R. Smilowitz, Carlos F. Daganzo:
  Continuum approximation techniques for the design of integrated package distribution systems. 183-196
  Electronic Edition (link) BibTeX
• Guizhen Liu, Jianfeng Hou, Jiansheng Cai:
  Some results about f-critical graphs. 197-202
  Electronic Edition (link) BibTeX
• B. S. Panda, Anita Das:
  On tree 3-spanners in directed path graphs. 203-210
  Electronic Edition (link) BibTeX
• Jing-Quan Li, Pitu B. Mirchandani, Denis Borenstein:
  The vehicle rescheduling problem: Model and algorithms. 211-229
  Electronic Edition (link) BibTeX

Volume 50, Number 4, December 2007

• Katerina Asdre, Stavros D. Nikolopoulos:
  A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs. 231-240
  Electronic Edition (link) BibTeX
• J. Gómez:
  Large vertex symmetric digraphs. 241-250
  Electronic Edition (link) BibTeX
• Geir Dahl:
  Majorization and distances in trees. 251-257
  Electronic Edition (link) BibTeX
• Hipólito Hernández-Pérez, Juan José Salazar González:
  The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms. 258-272
  Electronic Edition (link) BibTeX
• Sung-Pil Hong, Byung-Cheon Choi:
  Approximability of the k-server disconnection problem. 273-282
  Electronic Edition (link) BibTeX