Solving the assignment problem with the improved dual neural network

Xiaolin Hu; Jun Wang

doi:10.1007/978-3-642-21105-8_63

Solving the assignment problem with the improved dual neural network

Xiaolin Hu, Jun Wang

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

3 Citations (Scopus)

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(n ²) 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). © 2011 Springer-Verlag.

Original language	English
Title of host publication	Advances in Neural Networks
Subtitle of host publication	8th International Symposium on Neural Networks, ISNN 2011
Publisher	Springer Verlag
Pages	547-556
Volume	6675 LNCS
ISBN (Print)	9783642211041
DOIs	https://doi.org/10.1007/978-3-642-21105-8_63
Publication status	Published - 2011
Externally published	Yes
Event	8th International Symposium on Neural Networks, ISNN 2011 - Guilin, China Duration: 29 May 2011 → 1 Jun 2011

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6675 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	8th International Symposium on Neural Networks, ISNN 2011
Country/Territory	China
City	Guilin
Period	29/05/11 → 1/06/11

Research Keywords

analog circuits
Assignment problem
linear programming
quadratic programming
sorting problem

Access Output

10.1007/978-3-642-21105-8_63

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

Hu, X., & Wang, J. (2011). Solving the assignment problem with the improved dual neural network. In Advances in Neural Networks: 8th International Symposium on Neural Networks, ISNN 2011 (Vol. 6675 LNCS, pp. 547-556). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6675 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-642-21105-8_63

Hu, Xiaolin ; Wang, Jun. / Solving the assignment problem with the improved dual neural network. Advances in Neural Networks: 8th International Symposium on Neural Networks, ISNN 2011. Vol. 6675 LNCS Springer Verlag, 2011. pp. 547-556 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{1a94966abe01452a910466f593326d8e,

title = "Solving the assignment problem with the improved dual neural network",

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(n 2) 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). {\textcopyright} 2011 Springer-Verlag.",

keywords = "analog circuits, Assignment problem, linear programming, quadratic programming, sorting problem",

author = "Xiaolin Hu and Jun Wang",

year = "2011",

doi = "10.1007/978-3-642-21105-8_63",

language = "English",

isbn = "9783642211041",

volume = "6675 LNCS",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "547--556",

booktitle = "Advances in Neural Networks",

address = "Germany",

note = "8th International Symposium on Neural Networks, ISNN 2011 ; Conference date: 29-05-2011 Through 01-06-2011",

}

Hu, X & Wang, J 2011, Solving the assignment problem with the improved dual neural network. in Advances in Neural Networks: 8th International Symposium on Neural Networks, ISNN 2011. vol. 6675 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6675 LNCS, Springer Verlag, pp. 547-556, 8th International Symposium on Neural Networks, ISNN 2011, Guilin, China, 29/05/11. https://doi.org/10.1007/978-3-642-21105-8_63

Solving the assignment problem with the improved dual neural network. / Hu, Xiaolin; Wang, Jun.
Advances in Neural Networks: 8th International Symposium on Neural Networks, ISNN 2011. Vol. 6675 LNCS Springer Verlag, 2011. p. 547-556 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6675 LNCS).

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - Solving the assignment problem with the improved dual neural network

AU - Hu, Xiaolin

AU - Wang, Jun

PY - 2011

Y1 - 2011

N2 - During the last two decades, several neural networks have been proposed for solving the assignment problem, and most of them either consist of O(n 2) 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). © 2011 Springer-Verlag.

AB - During the last two decades, several neural networks have been proposed for solving the assignment problem, and most of them either consist of O(n 2) 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). © 2011 Springer-Verlag.

KW - analog circuits

KW - Assignment problem

KW - linear programming

KW - quadratic programming

KW - sorting problem

UR - http://www.scopus.com/inward/record.url?scp=79957850195&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-79957850195&origin=recordpage

U2 - 10.1007/978-3-642-21105-8_63

DO - 10.1007/978-3-642-21105-8_63

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 9783642211041

VL - 6675 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 547

EP - 556

BT - Advances in Neural Networks

PB - Springer Verlag

T2 - 8th International Symposium on Neural Networks, ISNN 2011

Y2 - 29 May 2011 through 1 June 2011

ER -

Hu X, Wang J. Solving the assignment problem with the improved dual neural network. In Advances in Neural Networks: 8th International Symposium on Neural Networks, ISNN 2011. Vol. 6675 LNCS. Springer Verlag. 2011. p. 547-556. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-21105-8_63

Solving the assignment problem with the improved dual neural network

Abstract

Publication series

Conference

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this