A discrete-time recurrent neural network for shortest-path routing

DOI10.1109/9.887639zbMath0976.90117OpenAlexW2153182718MaRDI QIDQ2730295

Jun Wang, Youshen Xia

Publication date: 5 August 2001

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/be4610ac2fece9af051bab8c4cfc38936c072ad2

zbMATH Keywords

neural networkscombinatorial optimizationdiscrete-timeshortest-path routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Neural networks for/in biological studies, artificial life and related topics (92B20)

Related Items

Dynamic threshold P systems with delay on synapses for shortest path problems ⋮ Matrix representation and extension of coalition analysis in group decision support ⋮ A type of biased consensus-based distributed neural network for path planning ⋮ Recurrent neural network model based on projective operator and its application to optimization problems ⋮ The dynamic wave expansion neural network model for robot motion planning in time-varying environments ⋮ A matrix-based approach to searching colored paths in a weighted colored multidigraph ⋮ A matrix approach to status quo analysis in the graph model for conflict resolution