E.L. Lawler, “Shortest path and network flow algorithms”, Annals of Discrete Mathematics 4 (1979) 251–263. MATH MathSciNetLawler EL.Shortest Path and Network Flow Algorithms.Annals of Discrete Mathematics. 1
Shortest path problem (SPPMulti-modal shortest path problem (M-SPPTime-windowLabel correcting algorithm (LCALabel setting algorithm (LSAThis paper investigates the algorithms of the multi-modal shortest path problem (M-SPP) under static and certain environment and their extension in urban transit ...
We formulate this bilevel, max-min prob- lem as a mixed-integer program (MIP), which can be solved directly, but we develop more efficient decompo- sition algorithms. One algorithm enhances Benders de- composition by adding generalized integer cutting planes, called "supervalid inequalities" (...
Shortest path algorithmstaxonomy and annotation Networks (1984) B.L. Golden et al. Deterministic network optimizationa bibliography Networks (1977) M. Desrochers et al. A new optimization algorithm for the vehicle routing problem with time windows Operations Research (1992) There are more references...
The proposed algorithms are worked in an N x N mesh wireless sensor network to concurrently perform global data aggregation and local data aggregation. Concurrent data aggregation is possible because an N x N mesh network has a unique address using the shuffled row major indexing method. Also, ...
Networks offer an intuitive visual representation of complex systems. Important network characteristics can often be recognized by eye and, in turn, patterns that stand out visually often have a meaningful interpretation. In conventional network layout algorithms, however, the precise determinants of a ...
The most commonly used traditional shortest path algorithms are Dijkstra algorithm and A ∗ algorithm. In 1959, E. W. Dijkstra first proposed an algorithm for solving the shortest path between two points in the weighted graph, namely, the Dijkstra algorithm, which can also be used to solve...
However, the parallel implementations of commonly used shortest-path algorithms are computationally demanding because of the inherent sequential nature of the search process used by the algorithms. This paper describes parallel implementations and includes performance analyses of two prominent graph algorithms...
The first category mainly includes some shallow neural network based algorithms such as DeepWalk9, node2vec10, LINE11, HOPE12 and struc2vec13, those algorithms decode graph structure into dense vectors with shallow neural network architectures and apply node classification, node ranking, as well as...
GUILD (Genes Underlying Inheritance Linked Disorders) is a framework built for the prioritization of disease candidate genes using a priori gene-disease associations and protein interactions. GUILD consists of implementations of 8 algorithms: NetScore, NetZcore, NetShort, NetCombo, fFlow, NetRank, Ne...