Results 31 to 40 of about 1,363,530 (305)
On Universal Shortest Paths [PDF]
The universal combinatorial optimization problem (Univ-COP) generalizes classical and new objective functions for combinatorial problems given by a ground set, a set of feasible solutions and costs assigned to the elements in the ground set. The corresponding universal objective function is of the sum type and associates additional multiplicative ...
Lara Turner, Horst W. Hamacher
openaire +2 more sources
Finding next-to-shortest paths in a graph [PDF]
We study the problem of finding the next-to-shortest paths in a graph. A next-to-shortest $(u,v)$-path is a shortest $(u,v)$-path amongst $(u,v)$-paths with length strictly greater than the length of the shortest $(u,v)$-path.
Krasikov, I +3 more
core +1 more source
Finding an induced path that is not a shortest path [PDF]
We give a polynomial-time algorithm that, with input a graph $G$ and two vertices $u,v$ of $G$, decides whether there is an induced $uv$-path that is longer than the shortest $uv$-path.
Eli Berger +2 more
openaire +3 more sources
Genetic algorithms with elitism-based immigrants for dynamic shortest path problem in mobile ad hoc networks [PDF]
This article is posted here with permission from the IEEE - Copyright @ 2009 IEEEIn recent years, the static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks (ANNs), genetic ...
Yang, S +5 more
core +1 more source
Shortest Paths in Microseconds
Extended version of WOSN'12 paper: new techniques (reduced memory, faster computations), distributed (MapReduce) algorithm, multiple paths between a source-destination ...
Rachit Agarwal 0001 +3 more
openaire +2 more sources
Multi-population genetic algorithms with immigrants scheme for dynamic shortest path routing problems in mobile ad hoc networks [PDF]
Copyright @ Springer-Verlag Berlin Heidelberg 2010.The static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks, genetic algorithms (GAs), particle swarm optimization, etc ...
Yang, S +5 more
core +1 more source
Shortest path poset of Bruhat intervals [PDF]
Let $[u,v]$ be a Bruhat interval and $B(u,v)$ be its corresponding Bruhat graph. The combinatorial and topological structure of the longest $u-v$ paths of $B(u,v)$ has been extensively studied and is well-known.
Saúl A. Blanco
doaj +1 more source
Speed-up Technique in Time-Varying Shortest Path Problems with Arbitrary Waiting Times [PDF]
Network flow problems are considered a vital branch of operations research. These problems are classified into static and time-varying classes. Network flow problems are time-varying in real application, because any flow must take a given amount of time ...
Gholamhasan Shirdel, Hasan Rezapour
doaj +1 more source
Exploring the brachistochrone (shortest-time) path in fire spread
The brachistochrone (shortest-time) curve is the path connecting two points that enables the shortest travel time. This work explores the “brachistochrone path” of fire spread connecting two points at the same altitude and with a fixed path length.
Peiyi Sun, Yanhui Liu, Xinyan Huang
doaj +1 more source
A Load Balancing Shortest Path Routing Algorithm for SRIO Network [PDF]
Routing selection algorithms are one of the important factors affecting transmission performance during serial RapidIO transmission.Aiming at the non-optimal allocation path of Serial Rapid Input and Output(SRIO) network depth search,this paper proposes ...
LI Jiawei, ZHANG Ji, ZHAO Juncai, DING Ruyi
doaj +1 more source

