{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:44:18Z","timestamp":1725583458495},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642211041"},{"type":"electronic","value":"9783642211058"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21105-8_63","type":"book-chapter","created":{"date-parts":[[2011,5,20]],"date-time":"2011-05-20T08:33:53Z","timestamp":1305880433000},"page":"547-556","source":"Crossref","is-referenced-by-count":3,"title":["Solving the Assignment Problem with the Improved Dual Neural Network"],"prefix":"10.1007","author":[{"given":"Xiaolin","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"63_CR1","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/BF01584237","volume":"21","author":"D.P. Bertsekas","year":"1981","unstructured":"Bertsekas, D.P.: A new algorithm for the assignment problem. Math. Prog.\u00a021(1), 152\u2013171 (1981)","journal-title":"Math. Prog."},{"issue":"3","key":"63_CR2","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1287\/opre.33.3.527","volume":"33","author":"Balinski","year":"1985","unstructured":"Balinski: Signature methods for the assignment problem. Operations Research\u00a033(3), 527\u2013536 (1985)","journal-title":"Operations Research"},{"key":"63_CR3","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/0893-6080(91)90039-8","volume":"4","author":"S.P. Eberhardt","year":"1991","unstructured":"Eberhardt, S.P., Daud, T., Kerns, D.A., Brown, T.X., Thakoor, A.P.: Competitive neural architecture for hardware solution to the assignment problem. Neural Networks\u00a04, 431\u2013442 (1991)","journal-title":"Neural Networks"},{"issue":"11","key":"63_CR4","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1049\/el:19920664","volume":"28","author":"J. Wang","year":"1992","unstructured":"Wang, J.: Analogue neural network for solving the assignment problem. Electronics Letters\u00a028(11), 1047\u20131050 (1992)","journal-title":"Electronics Letters"},{"issue":"3","key":"63_CR5","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/0893-6080(94)90081-7","volume":"7","author":"J.J. Kosowsky","year":"1994","unstructured":"Kosowsky, J.J., Yuille, A.L.: The invisible hand algorithm: solving the assignment problem with statistical physics. Neural Networks\u00a07(3), 477\u2013490 (1994)","journal-title":"Neural Networks"},{"key":"63_CR6","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1109\/81.296327","volume":"40","author":"K. Urahama","year":"1994","unstructured":"Urahama, K.: Analog circuit for solving assignment problem. IEEE Trans. Circuits Syst. I\u00a040, 426\u2013429 (1994)","journal-title":"IEEE Trans. Circuits Syst. I"},{"issue":"3","key":"63_CR7","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1109\/72.572114","volume":"8","author":"J. Wang","year":"1997","unstructured":"Wang, J.: Primal and dual assignment networks. IEEE Trans. Neural Netw.\u00a08(3), 784\u2013790 (1997)","journal-title":"IEEE Trans. Neural Netw."},{"issue":"1","key":"63_CR8","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1109\/72.655040","volume":"9","author":"J. Wang","year":"1998","unstructured":"Wang, J., Xia, Y.: Analysis and design of primal-dual assignment networks. IEEE Trans. Neural Netw.\u00a09(1), 183\u2013194 (1998)","journal-title":"IEEE Trans. Neural Netw."},{"issue":"12","key":"63_CR9","doi-asserted-by":"publisher","first-page":"2022","DOI":"10.1109\/TNN.2008.2003287","volume":"19","author":"X. Hu","year":"2008","unstructured":"Hu, X., Wang, J.: An improved dual neural network for solving a class of quadratic programming problems and its k-winners-take-all application. IEEE Trans. Neural Netw.\u00a019(12), 2022\u20132031 (2008)","journal-title":"IEEE Trans. Neural Netw."},{"key":"63_CR10","volume-title":"An Introduction to Variational Inequalities and Their Applications","author":"D. Kinderlehrer","year":"1980","unstructured":"Kinderlehrer, D., Stampcchia, G.: An Introduction to Variational Inequalities and Their Applications. Academic, New York (1980)"},{"issue":"4","key":"63_CR11","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/0893-6080(94)90041-8","volume":"7","author":"J. Wang","year":"1994","unstructured":"Wang, J.: A deterministic annealing neural network for convex programming. Neural Networks\u00a07(4), 629\u2013641 (1994)","journal-title":"Neural Networks"},{"issue":"4","key":"63_CR12","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1109\/TNN.2008.2011266","volume":"20","author":"X. Hu","year":"2009","unstructured":"Hu, X., Zhang, B.: A new recurrent neural network for solving convex quadratic programming problems with an application to the k-winners-take-all problem. IEEE Trans. Neural Netw.\u00a020(4), 654\u2013664 (2009)","journal-title":"IEEE Trans. Neural Netw."},{"issue":"6","key":"63_CR13","doi-asserted-by":"publisher","first-page":"1640","DOI":"10.1109\/TSMCB.2009.2025700","volume":"39","author":"X. Hu","year":"2009","unstructured":"Hu, X., Zhang, B.: An alternative recurrent neural network for solving variational inequalities and related optimization problems. IEEE Trans. Syst., Man, Cybern. B\u00a039(6), 1640\u20131645 (2009)","journal-title":"IEEE Trans. Syst., Man, Cybern. B"},{"issue":"6","key":"63_CR14","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1109\/TNN.2009.2012517","volume":"20","author":"L. Cheng","year":"2009","unstructured":"Cheng, L., Hou, Z.G., Tan, M.: A delayed projection neural network for solving linear variational inequalities. IEEE Trans. Neural Netw.\u00a020(6), 915\u2013925 (2009)","journal-title":"IEEE Trans. Neural Netw."},{"issue":"9","key":"63_CR15","doi-asserted-by":"publisher","first-page":"1741","DOI":"10.1109\/TCSI.2004.834493","volume":"51","author":"M. Forti","year":"2004","unstructured":"Forti, M., Nistri, P., Quincampoix, M.: Generalized neural network for nonsmooth nonlinear programming problems. IEEE Trans. Circuits Syst. I\u00a051(9), 1741\u20131754 (2004)","journal-title":"IEEE Trans. Circuits Syst. I"},{"issue":"4","key":"63_CR16","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1109\/TNN.2007.910736","volume":"19","author":"Q. Liu","year":"2008","unstructured":"Liu, Q., Wang, J.: A one-layer recurrent neural network with a discontinuous hard-limiting activation function for quadratic programming. IEEE Trans. Neural Netw.\u00a019(4), 558\u2013570 (2008)","journal-title":"IEEE Trans. Neural Netw."}],"container-title":["Lecture Notes in Computer Science","Advances in Neural Networks \u2013 ISNN 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21105-8_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T05:38:25Z","timestamp":1558589905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21105-8_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642211041","9783642211058"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21105-8_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}