Semantic Scholar uses AI to extract papers important to this topic.
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole… Expand In most vehicle routing and crew scheduling applications solved by column generation, the subproblem corresponds to a shortest… Expand We develop a shortest augmenting path algorithm for the linear assignment problem. It contains new initialization routines and a… Expand We propose shortest path algorithms that use A* search in combination with a new graph-theoretic lower-bounding technique based… Expand This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes… Expand We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our… Expand We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our… Expand We conduct an extensive computational study of shortest paths algorithms, including some very recent algorithms. We also suggest… Expand This note contains two fully polynomial approximation schemes for the shortest path problem with an additional constraint. The… Expand This paper treats five discrete shortest-path problems: 1 determining the shortest path between two specified nodes of a network… Expand