Accession Number:

AD0785119

Title:

Some New Algorithms for Deterministic and Probabilistic Communication Networks.

Descriptive Note:

Phase rept.,

Corporate Author:

PURDUE UNIV LAFAYETTE IND

Report Date:

1974-06-01

Pagination or Media Count:

92.0

Abstract:

The objective of the effort reported herein is twofold to develop more efficient algorithms for communication networks and to implement the algorithms. Two problems are included the maximum flow problem and the terminal-pair reliability problem. For the maximum flow problem, a new labeling algorithm has been proposed. A complete documentation of the computer program is included. Author

Subject Categories:

  • Operations Research
  • Non-Radio Communications

Distribution Statement:

APPROVED FOR PUBLIC RELEASE