#### Filter Results:

#### Publication Year

2000

2013

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We address the problem for finding the K best path trees connecting a source node with any other non-source node in a directed network with arbitrary lengths. The main result in this paper is the proof that the kth shortest path tree is adjacent to at least one of the previous (k−1) shortest path trees. Consequently, we design an O(+Km) time and O(K+m)… (More)

This paper introduces a new shortest path simplex pivot rule choosing a subset of non-basic arcs to simultaneously enter into the basis. The term multiple pivot for this operation is used. From this concept, a generic shortest path simplex algorithm with multiple pivots is described. In addition, a simplex multiple pivot rule is provided to design a… (More)

We introduce a new network simplex pivot rule for the shortest path simplex algorithm. This new pivot rule chooses a subset of non-basic arcs to enter into the basis simultaneously. We call to this operation multiple pivot. We show that a shortest path simplex algorithm with this pivot rule makes O(n) multiple pivots and runs in O(nm) time. This new pivot… (More)

We address the determination of the second point-to-point shortest simple path in undirected networks. The effective reduced cost concept is introduced to compute the second best solution. This concept is used to prove that a path tree containing the second point-to-point shortest simple path is adjacent to any shortest path tree. Therefore, this result… (More)

We design a new label shortest path algorithm by applying the concept of a pseudo permanent label. This approach allows an algorithm to partition the set of nodes into two new sets: pseudo permanently labeled nodes and its complementary set. From this point of view, this new label method can be considered as label setting and is also a Dijkstra (1959)… (More)