INCREASING THE CAPACITY OF A NETWORK: THE PARAMETRIC BUDGET PROBLEM

Abstract

The problem considered in this paper is that of allocating a budget of resources among the links of a network for the purpose of increasing its flow capacity relative to given sources and sinks. On the assumption that the cost of increasing each link capacity is linear, a labeling algorithm is described that permits rapid calculation of optimal allocations for all budgets.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 12, 1958
Accession Number
AD0606935

Entities

People

  • D. R. Fulkerson

Organizations

  • RAND Corporation

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Convex Sets
  • Equations
  • Hard Copy
  • Integrals
  • Linear Programming
  • Microfiche
  • Orientation (Direction)
  • Scanning
  • Sequences
  • Theorems
  • Transportation

Readers

  • Fluid Dynamics.
  • Life Cycle Cost Analysis
  • Tactical Satellite Communications Systems Engineering.