Skip to search formSkip to main contentSkip to account menu

Shortest path problem

Known as: Singledestination shortest path problem, Shortest path routing, Single-destination shortest path problem 
In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Abstract machineAndrew V. GoldbergAuction algorithmBidirectional search

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2010
Review
2010
The stratified shortest-paths problem
In the last ten years it has become clear that some Internet routing protocols do not compute globally optimal paths, but only… 
2010
2010
<formula formulatype="inline"><tex Notation="TeX">$K$</tex> </formula> Constrained Shortest Path Problem
Motivated by a real project for a sophisticated automated storage and retrieval system (AS/RS), we study the problem of… 
Highly Cited
2007
Highly Cited
2007
A mechanism for detection of gray hole attack in mobile Ad Hoc networks
Protecting the network layer from malicious attacks is an important and challenging security issue in mobile ad hoc networks… 
Highly Cited
2006
Highly Cited
2006
Program generation for the all-pairs shortest path problem
A recent trend in computing are domain-specific program generators, designed to alleviate the effort of porting and re-optimizing… 
Highly Cited
2006
Highly Cited
2006
Inferring Trust Relationships in Web-Based Social Networks
The growth of web-based social networking and the properties of those networks have created great potential for producing… 
Highly Cited
2003
Highly Cited
2003
On bandwidth efficiency of the hose resource management model in virtual private networks
The hose resource provisioning model promises to provide an easy-to-use characterization framework for virtual private network… 
2003
2003
Fuzzy Shortest-Path Network Problems With Uncertain Edge Weights
This paper presents two new types of fuzzy shortest-path network problems. We consider the edge weight of the network as… 
Highly Cited
1995
Highly Cited
1995
A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxations
We consider the basic Vehicle Routing Problem (VRP) in which a fleet ofM identical vehicles stationed at a central depot is to be… 
Highly Cited
1994
Highly Cited
1994
A recurrent neural network for solving the shortest path problem
The shortest path problem is the classical combinatorial optimization problem arising in numerous planning and designing contexts… 
1990
1990
Efficient Shortest Path Simplex Algorithms
We consider the specialization of the primal simplex algorithm to the problem of finding a tree of directed shortest paths from a… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)