Accession Number:

AD0606440

Title:

A SUGGESTED COMPUTATION FOR MAXIMAL MULTI-COMMODITY NETWORK FLOWS

Descriptive Note:

Corporate Author:

RAND CORP SANTA MONICA CA

Personal Author(s):

Report Date:

1958-03-27

Pagination or Media Count:

12.0

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.

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE