ON SOME COMMUNICATION NETWORK PROBLEMS

Abstract

Several classes of combinat2rial problems in the field of communication networks are discussed including the leasing of minimal cost spanning networks, the finding of optimal paths through networks, and the optimal routing of messages in networks. The methods employed involve curious admixtures of the functional equation approach of dynamic programming, linear programming, and various ad hoc procedures.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 03, 1959
Accession Number
AD0606855

Entities

People

  • Robert E. Kalaba

Organizations

  • RAND Corporation

Tags

Communities of Interest

  • Cyber

DTIC Thesaurus Topics

  • Algorithms
  • Communication Networks
  • Corporations
  • Doctrine
  • Dynamic Programming
  • Engineering
  • Equations
  • Hard Copy
  • Heuristic Methods
  • Inequalities
  • Linear Programming
  • Microfiche
  • Networks
  • Probability
  • Simplex Method
  • Steady State

Readers

  • Computer Networking
  • Operations Research