Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 208,178,107 papers from all fields of science

Search

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2005

Highly Cited

2005

Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole…

Highly Cited

2005

Highly Cited

2005

In most vehicle routing and crew scheduling applications solved by column generation, the subproblem corresponds to a shortest…

Highly Cited

2005

Highly Cited

2005

We develop a shortest augmenting path algorithm for the linear assignment problem. It contains new initialization routines and a…

Highly Cited

2005

Highly Cited

2005

We propose shortest path algorithms that use A* search in combination with a new graph-theoretic lower-bounding technique based…

Highly Cited

2002

Highly Cited

2002

This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes…

Highly Cited

1994

Highly Cited

1994

We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our…

Highly Cited

1992

Highly Cited

1992

This note contains two fully polynomial approximation schemes for the shortest path problem with an additional constraint. The…

Highly Cited

1991

Highly Cited

1991

We consider a stochastic version of the classical shortest path problem whereby for each node of a graph, we must choose a…

Highly Cited

1990

Highly Cited

1990

Efficient implementations of Dijkstra's shortest path algorithm are investigated. A new data structure, called the <italic>radix…

Highly Cited

1969

Highly Cited

1969

This paper treats five discrete shortest-path problems: 1 determining the shortest path between two specified nodes of a network…