Determining fastest routes using fixed schedules

  • Authors:

  • Bernard M. Levin;Stephen Hedetniemi

  • Affiliations:

  • National Bureau of Standards, Washington, D.C.;National Bureau of Standards, Washington, D.C.

  • Venue:
  • AFIPS '63 (Spring) Proceedings of the May 21-23, 1963, spring joint computer conference
  • Year:
  • 1963

Quantified Score

Hi-index 0.00

Visualization

Abstract

An interesting problem that is amenable to solution by digital computer is posed by the following questions. How late can a shipment be detained at city A so that it arrives at city B by a given time ? By what route should it be sent? The available routes consist of those provided by scheduled common carriers such as the airlines.