Some New Algorithms for Deterministic and Probabilistic Communication Networks.
PURDUE UNIV LAFAYETTE IND
Pagination or Media Count:
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
- Operations Research
- Non-Radio Communications