Networks

Table of Contents

Volume 41 Issue 3 (May 2003)

127-180

The single‐vehicle routing problem with unrestricted backhauls

  • Author: Haldun Süral, James H. Bookbinder
  • Pub Online: Feb 26, 2003
  • DOI: 10.1002/net.10067 (p 127-136)

Balanced network flows. VIII. A revised theory of phase‐ordered algorithms and the O ( log( n 2 / m )/log n ) bound for the nonbipartite cardinality matching problem

  • Author: Christian Fremuth‐Paeger, Dieter Jungnickel
  • Pub Online: Mar 04, 2003
  • DOI: 10.1002/net.10066 (p 137-142)

A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem

  • Author: Francisco Ortega, Laurence A. Wolsey
  • Pub Online: Mar 20, 2003
  • DOI: 10.1002/net.10068 (p 143-158)

Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees

  • Author: Luis Gouveia, Thomas L. Magnanti
  • Pub Online: Mar 24, 2003
  • DOI: 10.1002/net.10069 (p 159-173)

Small‐worlds: A review of recent books

  • Author: I. Frommer, G. Pundoor
  • Pub Online: Mar 24, 2003
  • DOI: 10.1002/net.10059 (p 174-180)

Related Topics

Related Publications

Related Content

Site Footer

Address:

This website is provided by John Wiley & Sons Limited, The Atrium, Southern Gate, Chichester, West Sussex PO19 8SQ (Company No: 00641132, VAT No: 376766987)

Published features on StatisticsViews.com are checked for statistical accuracy by a panel from the European Network for Business and Industrial Statistics (ENBIS)   to whom Wiley and StatisticsViews.com express their gratitude. This panel are: Ron Kenett, David Steinberg, Shirley Coleman, Irena Ograjenšek, Fabrizio Ruggeri, Rainer Göb, Philippe Castagliola, Xavier Tort-Martorell, Bart De Ketelaere, Antonio Pievatolo, Martina Vandebroek, Lance Mitchell, Gilbert Saporta, Helmut Waldl and Stelios Psarakis.