Heuristic Methods for Solving Large Scale Network Routing Problems: The Telpaking Problem
An approach to a large scale network routing problem with nonlinear cost function is described, along with an example of its application. The approach to the problem involves a multistage construction process. This approach is applied to the telpaking problem. Results are obtained in applying this method to a 53 node sample problem.
No Supplementary Data
No Article Media
Document Type: Research Article
Affiliations: Massachusetis Institute of Technology
Publication date: March 1, 1975