A MODIFIED SIMPLEX ALGORITHM FOR SOLVING THE MULTI-COMMODITY MAXIMUM FLOW PROBLEM,

reportActive / Technical Report | Accession Number: AD0675822 | Need Help?

Abstract:

The paper gives a detailed description of a modified simplex algorithm for solving the arc-chain formulation of the multi-commodity maximum flow problem. The modification of the simplex method is that of using a shortest path computation to replace the simplex step of selecting which vector enters the basis. Some computational results are also given. Author

Author(s):
Boyer, Donald D. ; Hunt, Donald J.
Author Organization(s):
GEORGE WASHINGTON UNIV WASHINGTON D C LOGISTICS RESEARCH PROJECT
Pagination:
0015

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
Serial T-211
Contract/Grant Number(s):
N00014-67-A-0214-0001
Task Number(s):
0001
Project Number(s):
NR-047-001
 Subject Terms
Communities of Interest:
No COI(s) Identified
Descriptor(s):
(*TRANSPORTATION, GRAPHICS), LINEAR PROGRAMMING, SIMPLEX METHOD, PROBLEM SOLVING, OPTIMIZATION, ALGORITHMS
Field(s)/Group(s):
Operations Research
Keyword(s):
COMPUTER ANALYSIS, MULTICOMMODITY FLOW, NETWORK FLOWS, OPTIMAL ROUTING PROBLEMS, NETWORKS, TRANSPORTATION
Report Date:
1968 Sep 01