Networks, Volume 41

Volume 41, Number 1, January 2003

• Jörg Kalcsics, Stefan Nickel, Justo Puerto:
  Multifacility ordered median problems on networks: A further analysis. 1-12
  Electronic Edition (link) BibTeX
• Olivier Goldschmidt, Dorit S. Hochbaum, Asaf Levin, Eli V. Olinick:
  The SONET edge-partition problem. 13-23
  Electronic Edition (link) BibTeX
• Victor Chepoi, Hartmut Noltemeier, Yann Vaxès:
  Upgrading trees under diameter and budget constraints. 24-35
  Electronic Edition (link) BibTeX
• Robert B. Dial:
  Toward faster algorithms for dynamic traffic assignment. I. Parametric quickest-path trees. 36-43
  Electronic Edition (link) BibTeX
• Shmuel Onn, Elisheva Sperber:
  Social network coordination and graph routing. 44-50
  Electronic Edition (link) BibTeX
• Felipe C. Calheiros, Abilio Lucena, Cid C. de Souza:
  Optimal rectangular partitions. 51-67
  Electronic Edition (link) BibTeX
• Anna Nagurney:
  Report: Some recent developments in network economics. 68-72
  Electronic Edition (link) BibTeX

Volume 41, Number 2, March 2003

• Ján Plesník:
  Towards minimum k-geodetically connected graphs. 73-82
  Electronic Edition (link) BibTeX
• Jean-Claude Bermond, Stéphan Ceroi:
  Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3. 83-86
  Electronic Edition (link) BibTeX
• G. Brightwell, G. Oriolo, F. Bruce Shepherd:
  Reserving resilient capacity for a single commodity with upper-bound constraints. 87-96
  Electronic Edition (link) BibTeX
• Igor Averbakh, Oded Berman:
  An improved algorithm for the minmax regret median problem on a tree. 97-103
  Electronic Edition (link) BibTeX
• Mauricio G. C. Resende, Celso C. Ribeiro:
  A GRASP with path-relinking for private virtual circuit routing. 104-114
  Electronic Edition (link) BibTeX
• J. Scott Provan:
  A polynomial-time algorithm to find shortest paths with recourse. 115-125
  Electronic Edition (link) BibTeX

Volume 41, Number 3, May 2003

• Haldun Süral, James H. Bookbinder:
  The single-vehicle routing problem with unrestricted backhauls. 127-136
  Electronic Edition (link) BibTeX
• Christian Fremuth-Paeger, Dieter Jungnickel:
  Balanced network flows. VIII. A revised theory of phase-ordered algorithms and the O( log(n2/m)/log n) bound for the nonbipartite cardinality matching problem. 137-142
  Electronic Edition (link) BibTeX
• Francisco Ortega, Laurence A. Wolsey:
  A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. 143-158
  Electronic Edition (link) BibTeX
• Luis Gouveia, Thomas L. Magnanti:
  Network flow models for designing diameter-constrained minimum-spanning and Steiner trees. 159-173
  Electronic Edition (link) BibTeX
• Ian Frommer, Guruprasad Pundoor:
  Small-worlds: A review of recent books. 174-180
  Electronic Edition (link) BibTeX

Volume 41, Number 4, July 2003

• Mário S. Rosa:
  Ernesto de Queirós Vieira Martins (1945-2000): An appreciation. 181-183
  Electronic Edition (link) BibTeX
• José M. P. Paixão, Ernesto de Queirós Vieira Martins, Mário S. Rosa, José Luis E. Dos Santos:
  The determination of the path with minimum-cost norm value. 184-196
  Electronic Edition (link) BibTeX
• Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria Grazia Scutellà:
  Dynamic shortest paths minimizing travel times and costs. 197-205
  Electronic Edition (link) BibTeX
• João C. N. Clímaco, José M. F. Craveirinha, Marta M. B. Pascoal:
  A bicriterion approach for routing problems in multimedia networks. 206-220
  Electronic Edition (link) BibTeX
• Dalila B. M. M. Fontes, Eleni Hadjiconstantinou, Nicos Christofides:
  Upper bounds for single-source uncapacitated concave minimum-cost network flow problems. 221-228
  Electronic Edition (link) BibTeX
• Domingos Moreira Cardoso, Jorge Freire de Sousa:
  A numerical tool for multiattribute ranking problems. 229-234
  Electronic Edition (link) BibTeX
• Ana Maria De Almeida, Rosália Rodrigues:
  Trees, slices, and wheels: On the floorplan area minimization problem. 235-244
  Electronic Edition (link) BibTeX