Results 1 to 10 of about 342,542 (204)
Solving the Network Shortest Path Problem on a Quantum Annealer
IEEE Transactions on Quantum Engineering, 2020 This article addresses the formulation for implementing a single source, single-destination shortest path algorithm on a quantum annealing computer. Three distinct approaches are presented.
Thomas Krauss, Joey McCollum
doaj +2 more sources
On Solving the Quadratic Shortest Path Problem [PDF]
INFORMS Journal on Computing, 2017 The quadratic shortest path problem is the problem of finding a path in a directed graph such that the sum of interaction costs over all pairs of arcs on the path is minimized.
Hao Hu, R. Sotirov
semanticscholar +7 more sources
A Bio-Inspired Method for the Constrained Shortest Path Problem [PDF]
The Scientific World Journal, 2014 The constrained shortest path (CSP) problem has been widely used in transportation optimization, crew scheduling, network routing and so on. It is an open issue since it is a NP-hard problem.
Hongping Wang +4 more
doaj +2 more sources
On the Quadratic Shortest Path Problem [PDF]
The Sea, 2015 Finding the shortest path in a directed graph is one of the most important combinatorial optimization problems, having applications in a wide range of fields. In its basic version, however, the problem fails to represent situations in which the value of the objective function is determined not only by the choice of each single arc, but also by the ...
Borzou Rostami +3 more
semanticscholar +5 more sources
Shortest path problem in fuzzy, intuitionistic fuzzy and neutrosophic environment: an overview
Complex & Intelligent Systems, 2019 In the last decade, concealed by uncertain atmosphere, many algorithms have been studied deeply to workout the shortest path problem. In this paper, we compared the shortest path problem with various existing algorithms.
Broumi Said +2 more
exaly +2 more sources
On the K shortest path trees problem [PDF]
European Journal of Operational Research, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Antonio Sedeño-Noda
exaly +2 more sources
On the minimum eccentricity shortest path problem
Theoretical Computer Science, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
F. Dragan, Arne Leitert
semanticscholar +5 more sources
Interval Type 2 Fuzzy Set in Fuzzy Shortest Path Problem
Mathematics, 2016 The shortest path problem (SPP) is one of the most important combinatorial optimization problems in graph theory due to its various applications. The uncertainty existing in the real world problems makes it difficult to determine the arc lengths exactly.
Arindam Dey, Anita Pal, Tandra Pal
doaj +2 more sources
The Steiner bi-objective shortest path problem
EURO Journal on Computational Optimization, 2021 In this paper, we introduce the Steiner Bi-objective Shortest Path Problem. This problem is defined on a directed graph G=(V,A), with a subset T⊂V of terminals. Arcs are labeled with travel time and cost.
Hamza Ben Ticha +3 more
doaj +1 more source
Shortest Path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm
Journal of Computing Research and Innovation, 2020 The shortest path is an issue that involves the route from one point (nodes) to another. It is to find a path with a minimum travelling time. Nowadays, traffic problems have affected many transport users especially in Kuala Lumpur area.
Nur Syuhada Muhammat Pazil +2 more
doaj +5 more sources