An Auction Algorithm for Shortest Paths

A Joint Structure comprising a first member including four essentially L-shaped hooks and a spring biased plate, a second member having a plurality of apertures adapted to receive the four L-shaped hooks and the spring biased plate whereby the L-shaped hooks are rigidly held in a fixed position within the plurality of apertures by the spring biased plate.

[1]  T. A. J. Nicholson,et al.  Finding the Shortest Route between Two Points in a Network , 1966, Comput. J..

[2]  Robert B. Dial,et al.  Algorithm 360: shortest-path forest with topological ordering [H] , 1969, CACM.

[3]  U. Pape,et al.  Implementation and efficiency of Moore-algorithms for the shortest route problem , 1974, Math. Program..

[4]  Darwin Klingman,et al.  NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[5]  F. Glover,et al.  A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees , 1979, Networks.

[6]  Aaron Kershenbaum,et al.  A note on finding shortest path trees , 1981, Networks.

[7]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[8]  Dimitri Bertsekas,et al.  Distributed dynamic programming , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[9]  Nesa L'abbe Wu,et al.  Linear programming and extensions , 1981 .

[10]  Douglas R. Shiert,et al.  Properties of Labeling Methods for Determining Shortest Path Trees , 1981 .

[11]  Dimitri P. Bertsekas,et al.  A new algorithm for the assignment problem , 1981, Math. Program..

[12]  F. Glover,et al.  New Polynomial Shortest Path Algorithms and Their Computational Attributes , 1985 .

[13]  D. Bertsekas.  Distributed relaxation methods for linear network flow problems , 1986, 1986 25th IEEE Conference on Decision and Control.

[14]  G. Gallo,et al.  SHORTEST PATH METHODS: A UNIFYING APPROACH , 1986 .

[15]  D. Bertsekas.  The auction algorithm: A distributed relaxation method for the assignment problem , 1988 .

[16]  Dimitri P. Bertsekas,et al.  Dual coordinate step methods for linear network flow problems , 1988, Math. Program..

[17]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[18]  Dimitri P. Bertsekas,et al.  The Auction Algorithm for Assignment and Other Network Flow Problems: A Tutorial , 1990 .

[19]  Lazaros Polymenakos.  Analysis of parallel asynchronous schemes for the auction shortest path algorithm , 1991 .

[20]  J. Walrand,et al.  Distributed Dynamic Programming , 2022 .