Showing papers on "Routing table published in 1974"
TL;DR: The problem of finding optimal routes in a packet-switched computer network can be formulated as a nonlinear multicommodity flow problem.
Abstract: The problem of finding optimal routes in a packet-switched computer network can be formulated as a nonlinear multicommodity flow problem.
226 citations
TL;DR: This paper describes the construction of a mathematical model and the results of its use in planning the pattern of routing in a national, complex distribution network; the model's particular feature being its ability to balance return loads on routes where two-way flow is possible.
Abstract: This paper describes the construction of a mathematical model and the results of its use in planning the pattern of routing in a national, complex distribution network; the model's particular feature being its ability to balance return loads on routes where two-way flow is possible.
2 citations
01 Jan 1974
TL;DR: An integrated systems approach has been used to formulate a model for the analysis of routes and the routing of vehicles that utilizes the network to optimally route a vehicle from a specified starting point to a given destination.
Abstract: An integrated systems approach has been used to formulate a model for the analysis of routes and the routing of vehicles. The essential data to describe the available routes are stored in the form of a network; the directional relationships and the relative location of the routes are established with the aid of a grid. The GASP II simulator has been used to develop the model. The model utilizes the network to optimally route a vehicle from a specified starting point to a given destination; it employs a variety of techniques which includes dynamic programming, branch and bound, and simulation.