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
ICANN'11 Proceedings of the 21st international conference on Artificial neural networks - Volume Part II
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
Generalized recurrent neural network for ε-insensitive support vector regression
Mathematics and Computers in Simulation
| Hi-index | 0.00 |
The assignment problem is an archetypical combinatorial optimization problem having widespread applications. This paper presents two recurrent neural networks, a continuous-time one and a discrete-time one, for solving the assignment problem. Because the proposed recurrent neural networks solve the primal and dual assignment problems simultaneously, they are called primal-dual assignment networks. The primal-dual assignment networks are guaranteed to make optimal assignment regardless of initial conditions. Unlike the primal or dual assignment network, there is no time-varying design parameter in the primal-dual assignment networks. Therefore, they are more suitable for hardware implementation. The performance and operating characteristics of the primal-dual assignment networks are demonstrated by means of illustrative examples