Skip to main content
padlock icon - secure page this page is secure

Heuristic Methods for Solving Large Scale Network Routing Problems: The Telpaking Problem

Buy Article:

$59.00 + tax (Refund Policy)

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 References
No Citations
No Supplementary Data
No Article Media
No Metrics

Document Type: Research Article

Affiliations: Massachusetis Institute of Technology

Publication date: March 1, 1975

  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
X
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more