Solving the assignment problem with the improved dual neural network

Authors:
Xiaolin Hu;Jun Wang
Affiliations:
State Key Laboratory of Intelligent Technology and Systems, Tsinghua National Laboratory for Information Science and Technology, Department of Computer Science and Technology, Tsinghua University, ...;Department of Mechanical and Automation Engineering, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong, China
Venue:
ISNN'11 Proceedings of the 8th international conference on Advances in neural networks - Volume Part I
Year:
2011

Citing 10
Cited 0

Competitive neural architecture for hardware solution to the assignment problem

Neural Networks
A deterministic annealing neural network for convex programming

Neural Networks
The invisible hand algorithm: solving the assignment problem with statistical physics

Neural Networks
A new recurrent neural network for solving convex quadratic programming problems with an application to the k-winners-take-all problem

IEEE Transactions on Neural Networks
A delayed projection neural network for solving linear variational inequalities

IEEE Transactions on Neural Networks
An alternative recurrent neural network for solving variational inequalities and related optimization problems

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Primal and dual assignment networks

IEEE Transactions on Neural Networks
Analysis and design of primal-dual assignment networks

IEEE Transactions on Neural Networks
A One-Layer Recurrent Neural Network With a Discontinuous Hard-Limiting Activation Function for Quadratic Programming

IEEE Transactions on Neural Networks
An Improved Dual Neural Network for Solving a Class of Quadratic Programming Problems and Its -Winners-Take-All Application

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

During the last two decades, several neural networks have been proposed for solving the assignment problem, and most of them either consist of O(n2) neurons (processing units) or contain some time varying parameters. In the paper, based on the improved dual neural network proposed recently, we present a new assignment network with 2n neurons and some constant parameters only. Compared with the existing neural networks for solving the assignment problem, its more favorable for implementation. Numerical simulation results indicate that the time complexity of the network is O(n).