Primal and dual assignment networks

Authors:
Jun Wang
Affiliations:
Dept. of Mech. & Autom. Eng., Chinese Univ. of Hong Kong, Shatin
Venue:
IEEE Transactions on Neural Networks
Year:
1997

Citing 0
Cited 15

Using Hopfield Networks to Solve Assignment Problem and N-Queen Problem: An Application of Guided Trial and Error Technique

SETN '02 Proceedings of the Second Hellenic Conference on AI: Methods and Applications of Artificial Intelligence
On the global output convergence of a class of recurrent neural networks with time-varying inputs

Neural Networks
A new approach to solve the traveling salesman problem

Neurocomputing
A one-layer recurrent neural network with a discontinuous activation function for linear programming

Neural Computation
Global Output Convergence of a Class of Recurrent Delayed Neural Networks with Discontinuous Neuron Activations

Neural Processing Letters
Delayed Lagrangian neural networks for solving convex programming problems

Neurocomputing
A new one-layer neural network for linear and quadratic programming

IEEE Transactions on Neural Networks
A one-layer dual neural network with a unipolar hard-limiting activation function for shortest-path routing

ICANN'10 Proceedings of the 20th international conference on Artificial neural networks: Part II
Solving the assignment problem with the improved dual neural network

ISNN'11 Proceedings of the 8th international conference on Advances in neural networks - Volume Part I
A one-layer dual recurrent neural network with a heaviside step activation function for linear programming with its linear assignment application

ICANN'11 Proceedings of the 21st international conference on Artificial neural networks - Volume Part II
Application of the “winner takes all” principle in wang's recurrent neural network for the assignment problem

ISNN'05 Proceedings of the Second international conference on Advances in Neural Networks - Volume Part I
A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization

Neural Networks
A delayed lagrangian network for solving quadratic programming problems with equality constraints

ISNN'06 Proceedings of the Third international conference on Advances in Neural Networks - Volume Part I
A new neural network approach to the traveling salesman problem

ISNN'06 Proceedings of the Third international conference on Advances in Neural Networks - Volume Part I
A one-layer recurrent neural network for constrained nonsmooth invex optimization

Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents two recurrent neural networks for solving the assignment problem. Simplifying the architecture of a recurrent neural network based on the primal assignment problem, the first recurrent neural network, called the primal assignment network, has less complex connectivity than its predecessor. The second recurrent neural network, called the dual assignment network, based on the dual assignment problem, is even simpler in architecture than the primal assignment network. The primal and dual assignment networks are guaranteed to make optimal assignment. The applications of the primal and dual assignment networks for sorting and shortest-path routing are discussed. The performance and operating characteristics of the dual assignment network are demonstrated by means of illustrative examples