SENSITIVITY ANALYSIS IN MULTITERMINAL FLOW NETWORKS

Abstract

Algorithms are given for determining the influence of varying the capacity of an arc or of several arcs with linearly related capacities, on the maximal flows between every pair of nodes in an undirected network. This work builds upon the fundamental work of Gomory and Hu, and is closely related to the approach of Elmaghraby, who also gives algorithms for solving these problems.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1967
Accession Number
AD0658510

Entities

People

  • Francisco K. Rado

Organizations

  • University of California, Berkeley

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Computations
  • Construction
  • Flow Network
  • Iterations
  • Military Research
  • Numbers
  • Operations Research
  • Real Numbers
  • Sensitivity
  • Sequences
  • Terminals
  • United States
  • United States Government
  • Universities

Readers

  • Graph Algorithms and Convex Optimization.
  • Operations Research