A SUGGESTED COMPUTATION FOR MAXIMAL MULTI-COMMODITY NETWORK FLOWS

Abstract

A simplex computation for an arc-chain formulation of the maximal multi-commodity network flow problem is proposed. Since the number of variables in this formulation is too large to be dealt with explicitly, the computation treats non-basic variables implicitly by replacing the usual method of determining a vector to enter the basis with several applications of a combinatorial algorithm for finding a shortest chain joining a pair of points in a network.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 27, 1958
Accession Number
AD0606440

Entities

People

  • Jr. R. Ford L. R.

Organizations

  • RAND Corporation

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Commodities
  • Communication Networks
  • Computations
  • Hard Copy
  • Heuristic Methods
  • Linear Programming
  • Networks
  • Simplex Method
  • Standards

Fields of Study

  • Mathematics

Readers

  • Operations Research