Topic

# Yen's algorithm

About: Yen's algorithm is a research topic. Over the lifetime, 2679 publications have been published within this topic receiving 67646 citations.

##### Papers
More filters
Journal ArticleDOI
TL;DR: The procedure was originally programmed in FORTRAN for the Control Data 160 desk-size computer and was limited to te t ra t ion because subroutine recursiveness in CONTROL Data 160 FORTRan has been held down to four levels in the interests of economy.
Abstract: procedure ari thmetic (a, b, c, op); in t eger a, b, c, op; ¢ o n l m e n t This procedure will perform different order ar i thmetic operations with b and c, put t ing the result in a. The order of the operation is given by op. For op = 1 addit ion is performed. For op = 2 multiplicaLion, repeated addition, is done. Beyond these the operations are non-commutat ive. For op = 3 exponentiat ion, repeated multiplication, is done, raising b to the power c. Beyond these the question of grouping is important . The innermost implied parentheses are at the right. The hyper-exponent is always c. For op = 4 te t ra t ion, repeated exponentiat ion, is done. For op = 5, 6, 7, etc., the procedure performs pentat ion, hexation, heptat ion, etc., respectively. The routine was originally programmed in FORTRAN for the Control Data 160 desk-size computer. The original program was limited to te t ra t ion because subroutine recursiveness in Control Data 160 FORTRAN has been held down to four levels in the interests of economy. The input parameter , b, c, and op, must be positive integers, not zero; b e g i n own i n t e g e r d, e, f, drop; i f o p = 1 t h e n b e g i n a := h-4c; go t o l e n d i f o p = 2 t h e n d := 0; else d := 1; e := c; drop := op 1; for f := I s t e p 1 u n t i l e do b e g i n ari thmetic (a, b, d, drop);

3,848 citations

Journal ArticleDOI
TL;DR: The significance of the new algorithm is that its computational upper bound increases only linearly with the value of K, so it is extremely efficient as compared with the algorithms proposed by Bock, Kantner, and Haynes and others.
Abstract: This paper presents an algorithm for finding the K loopless paths that have the shortest lengths from one node to another node in a network. The significance of the new algorithm is that its computational upper bound increases only linearly with the value of K. Consequently, in general, the new algorithm is extremely efficient as compared with the algorithms proposed by Bock, Kantner, and Haynes [2], Pollack [7], [8], Clarke, Krikorian, and Rausan [3], Sakarovitch [9] and others. This paper first reviews the algorithms presently available for finding the K shortest loopless paths in terms of the computational effort and memory addresses they require. This is followed by the presentation of the new algorithm and its justification. Finally, the efficiency of the new algorithm is examined and compared with that of other algorithms.

2,135 citations

Journal ArticleDOI
TL;DR: A shortest augmenting path algorithm for the linear assignment problem that contains new initialization routines and a special implementation of Dijkstra's shortest path method is developed.
Abstract: We develop a shortest augmenting path algorithm for the linear assignment problem. It contains new initialization routines and a special implementation of Dijkstra's shortest path method. For both dense and sparse problems computational experiments show this algorithm to be uniformly faster than the best algorithms from the literature. A Pascal implementation is presented.

1,196 citations

Journal ArticleDOI
01 Oct 1959
TL;DR: In this paper, it was shown that the length of the shortest closed path through n points in a bounded plane region of area v is almost always asymptotically proportional to √(nv) for large n; and this result was extended to bounded Lebesgue sets in k-dimensional Euclidean space.
Abstract: We prove that the length of the shortest closed path through n points in a bounded plane region of area v is ‘almost always’ asymptotically proportional to √(nv) for large n; and we extend this result to bounded Lebesgue sets in k–dimensional Euclidean space. The constants of proportionality depend only upon the dimensionality of the space, and are independent of the shape of the region. We give numerical bounds for these constants for various values of k; and we estimate the constant in the particular case k = 2. The results are relevant to the travelling-salesman problem, Steiner's street network problem, and the Loberman—Weinberger wiring problem. They have possible generalizations in the direction of Plateau's problem and Douglas' problem.

902 citations

Journal ArticleDOI
TL;DR: In this article, five discrete shortest-path problems are treated: finding the shortest path between two specified nodes of a network, determining the shortest paths between all pairs of nodes in a network; determining the second, third, etc., shortest path; 4 determining the fastest path through a network with travel times depending on the departure time; and 5 finding the short path between specified endpoints that passes through specified intermediate nodes.
Abstract: This paper treats five discrete shortest-path problems: 1 determining the shortest path between two specified nodes of a network; 2 determining the shortest paths between all pairs of nodes of a network; 3 determining the second, third, etc., shortest path; 4 determining the fastest path through a network with travel times depending on the departure time; and 5 finding the shortest path between specified endpoints that passes through specified intermediate nodes. Existing good algorithms are identified while some others are modified to yield efficient procedures. Also, certain misrepresentations and errors in the literature are demonstrated.

894 citations

##### Network Information
###### Related Topics (5)
Scheduling (computing)
78.6K papers, 1.3M citations
78% related
Linear programming
32.1K papers, 920.3K citations
77% related
Metaheuristic
29.9K papers, 921K citations
77% related
Fuzzy logic
151.2K papers, 2.3M citations
76% related
Optimization problem
96.4K papers, 2.1M citations
76% related
##### Performance
###### Metrics
No. of papers in the topic in previous years
YearPapers
202317
202252
20192
20186
201791
2016119