A universal concept for robust solving of shortest path problems in dynamically reconfigurable graphs
DOI10.1155/2015/345049zbMath1394.68264OpenAlexW2202860482WikidataQ59118081 ScholiaQ59118081MaRDI QIDQ1665401
Kyandoghere Kyamakya, Jean Chamberlain Chedjou
Publication date: 27 August 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2015/345049
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- A review of Hopfield neural networks for solving mathematical programming problems
- ``Neural computation of decisions in optimization problems
- Finding the most vital node of a shortest path.
- A new approach to all-pairs shortest paths on real-weighted graphs
- Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context
- Heuristic shortest path algorithms for transportation applications: state of the art
- Undirected single-source shortest paths with positive integer weights in linear time
- On a routing problem
- UTILIZING DISTRIBUTED LEARNING AUTOMATA TO SOLVE STOCHASTIC SHORTEST PATH PROBLEMS
- All pairs shortest paths using bridging sets and rectangular matrix multiplication
- Scaling Algorithms for the Shortest Paths Problem
- Algorithms – ESA 2004
- On the Shortest Path Through a Number of Points
- Encyclopedia of Algorithms
- Improved calculation method of shortest path with cellular automata model
This page was built for publication: A universal concept for robust solving of shortest path problems in dynamically reconfigurable graphs
