Solving the Assignment Problem Using Continuous-Time and Discrete-Time Improved Dual Networks

The assignment problem is an archetypal combinatorial optimization problem. In this brief, we present a continuous-time version and a discrete-time version of the improved dual neural network (IDNN) for solving the assignment problem. Compared with most assignment networks in the literature, the two...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transaction on neural networks and learning systems Jg. 23; H. 5; S. 821 - 827
Hauptverfasser:	Hu, Xiaolin, Wang, Jun
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York, NY IEEE 01.05.2012 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Analog circuits Applied sciences Artificial intelligence assignment problem Biological neural networks Circuits Combinatorial analysis Computer science; control theory; systems Connectionism. Neural networks Convergence Decision Support Techniques Equations Exact sciences and technology Game Theory Learning Learning systems linear programming Networks Neural networks Neural Networks (Computer) Neurons Optimization Pattern Recognition, Automated - methods quadratic programming sorting problem Trajectory Upper bound Analog circuit Combinatorial problem Analog circuits assignment problem Linear programming Continuous time sorting problem Neural network Combinatorial optimization Quadratic programming Sorting Discrete time Problem solving Mathematical programming
ISSN:	2162-237X, 2162-2388, 2162-2388
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!