J. Y. Yen

Finding the K Shortest Loopless Paths in a Network

J. Y. Yen, 1971 .

Finding the K Shortest Loopless Paths in a Network

J. Y. Yen, Jin Y. YENt, Jin Y. Yen, 2007 .

An algorithm for finding shortest routes from all source nodes to a given destination in general networks

J. Y. Yen, 1970 .

A procedure for computing the k best solutions of discrete optimization problems and its applications to the shortest path problem

J. Y. Yen, 1972 .

Notes--On the Efficiency of a Direct Search Method to Locate Negative Cycles in a Network

Jin Y. Yen, J. Y. Yen, 1972 .

Finding the Lengths of All Shortest paths in N -Node Nonnegative-Distance Complete Networks Using 12N3 Additions and N3 Comparisons

Jin Y. Yen, J. Y. Yen, 1972, JACM.