A hill-jump algorithm of Hopfield neural network for shortest path problem in communication network
type: Item
instance of: scholarly article
title: A hill-jump algorithm of Hopfield neural network for shortest path problem in communication network
zbMATH Open document ID: 1175.68428
author: Rong-Long Wang
author: Shanshan Guo
author: Kozo Okazaki
published in: Soft Computing
publication date: 2009-09-18T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5605039
zbMATH Keywords: shortest path problem
zbMATH Keywords: combinatorial optimization problem
zbMATH Keywords: Hopfield neural network
zbMATH Keywords: hill-jump algorithm
zbMATH Keywords: local minimum
MaRDI profile type: Publication
full work available at URL: s00500-008-0313-0
OpenAlex ID: W2022190717
cites work: Computation of shortest path in cellular automata
cites work: Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks
cites work: Optimal Routing in a Packet-Switched Computer Network
cites work: A note on two problems in connexion with graphs
cites work: Control and optimization methods in communication network problems
cites work: Routing in computer networks
cites work: The flow deviation method: An approach to store‐and‐forward communication network design
cites work: A Minimum Delay Routing Algorithm Using Distributed Computation
cites work: Neurons with graded response have collective computational properties like those of two-state neurons.
cites work: ``Neural'' computation of decisions in optimization problems
cites work: A k shortest path algorithm for adaptive routing in communications networks
cites work: An optimal distributed routing algorithm
cites work: Minimum cost routing for dynamic network models
DOI: 10.1007/S00500-008-0313-0
description: scientific article; zbMATH DE number 5605039