Table of Contents

Volume 20 Issue 4 (July 1990)

fmi-fmi, 361-485



  • Author:
  • Pub Online: Oct 11, 2006
  • DOI: 10.1002/net.3230200401 (p fmi-fmi)


Disjoint ( s, t )‐cuts in a network

  • Author: Donald K. Wagner
  • Pub Online: Oct 11, 2006
  • DOI: 10.1002/net.3230200402 (p 361-371)

A heuristic algorithm for a network problem with variable upper bounds

  • Author: Bala Shetty
  • Pub Online: Oct 11, 2006
  • DOI: 10.1002/net.3230200403 (p 373-389)

Optimal location of a path or tree on a network with cycles

  • Author: Michael B. Richey
  • Pub Online: Oct 11, 2006
  • DOI: 10.1002/net.3230200404 (p 391-407)

Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities

  • Author: Hiroshi Nagamochi, Masao Fukushima, Toshihide Lbaraki
  • Pub Online: Oct 11, 2006
  • DOI: 10.1002/net.3230200405 (p 409-426)

A graph‐theoretic approach to investigate structural and qualitative properties of systems: A survey

  • Author: Takeo Yamada, Leslie R. Foulds
  • Pub Online: Oct 11, 2006
  • DOI: 10.1002/net.3230200406 (p 427-452)

Algorithms for special cases of rectilinear steiner trees: I. Points on the boundary of a rectilinear rectangle

  • Author: Pankaj Kumar Agarwal, Man‐Tak Shing
  • Pub Online: Oct 11, 2006
  • DOI: 10.1002/net.3230200407 (p 453-485)

Related Topics

Related Publications

Related Content

Site Footer


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 are checked for statistical accuracy by a panel from the European Network for Business and Industrial Statistics (ENBIS)   to whom Wiley and 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.