Results 231 to 240 of about 286,038 (288)
A compressive sensing-driven data collection scheme for UAV-assisted wireless sensor networks. [PDF]
Sci RepHan Z, Zheng G, Li C, Wang G, Mu Y.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2000
Consider a digraph G = (V, E) with non- negative costs c(e) = c ij (∀ e = (i, j) ∈ E) associated with the edges in G. To simplify further notation we define c ij := ∞ for all (i, j) ∉ E.
Horst W. Hamacher, Kathrin Klamroth
openaire +2 more sources
Consider a digraph G = (V, E) with non- negative costs c(e) = c ij (∀ e = (i, j) ∈ E) associated with the edges in G. To simplify further notation we define c ij := ∞ for all (i, j) ∉ E.
Horst W. Hamacher, Kathrin Klamroth
openaire +2 more sources
Thek-centrum shortest path problem
TOP, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Garfinkel, Robert +2 more
openaire +1 more source
Solvingk-shortest and constrained shortest path problems efficiently
Annals of Operations Research, 1989zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Skiscim, Christopher C. +1 more
openaire +2 more sources
Computers & Industrial Engineering, 1994
Abstract We discuss the problem of finding the shortest paths from a fixed origin to a specified nodes in a network with arcs represented as intervals on real line. As a preliminary, we define the order relation between intervals by using two parameters.
Shinkoh Okada, Mitsuo Gen
openaire +1 more source
Abstract We discuss the problem of finding the shortest paths from a fixed origin to a specified nodes in a network with arcs represented as intervals on real line. As a preliminary, we define the order relation between intervals by using two parameters.
Shinkoh Okada, Mitsuo Gen
openaire +1 more source
On Bounded Leg Shortest Paths Problems
Algorithmica, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Roditty, Liam, Segal, Michael
openaire +2 more sources
Upgrading Shortest Path Problems
2023There are several areas where the shortest path problem exists.One well-known algorithm is the Dijkstra Algorithm.The "Dijkstra Algorithm" has one flaw, according to the results of the experiments, namely that it doesn't deal with the issue of adjacent vertices in the shortest path.The algorithm has seen substantial improvement.
Shra Fatima, Kamlesh Chandra Maurya
openaire +1 more source
The Fixed-Charge Shortest-Path Problem
INFORMS Journal on Computing, 2012Consider a network 𝒩 =(N, A) and associate with each arc e ∈ A a fixed cost ce for using arc e, an interval [le, ue] (le, ue ∈ ℤ) specifying the range of allowable resource consumption quantities along arc e, and a per-unit cost [Formula: see text] for resource consumed along e.
Engineer, Faramroze G. +3 more
openaire +2 more sources