{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T06:41:53Z","timestamp":1772088113372,"version":"3.50.1"},"reference-count":30,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1992,4]]},"DOI":"10.1016\/0305-0548(92)90051-6","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"297-311","source":"Crossref","is-referenced-by-count":37,"title":["Recurrent neural networks for linear programming: Analysis and design principles"],"prefix":"10.1016","volume":"19","author":[{"given":"Jun","family":"Wang","sequence":"first","affiliation":[]},{"given":"Vira","family":"Chankong","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(92)90051-6_BIB1","series-title":"Inequalities III","first-page":"159","article-title":"How good is the simplex algorithm?","author":"Klee","year":"1972"},{"key":"10.1016\/0305-0548(92)90051-6_BIB2","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1287\/opre.29.6.1039","article-title":"The ellipsoid method: a survey","volume":"29","author":"Bland","year":"1981","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(92)90051-6_BIB3","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BF02579150","article-title":"A new polynomial-time algorithm for linear programming","volume":"4","author":"Karmarkar","year":"1984","journal-title":"Combinatorica"},{"key":"10.1016\/0305-0548(92)90051-6_BIB4","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1287\/inte.16.4.75","article-title":"Karmarkar's linear programming algorithm","volume":"14","author":"Hooker","year":"1986","journal-title":"Interfaces"},{"key":"10.1016\/0305-0548(92)90051-6_BIB5","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BF01840456","article-title":"A polynomial Newton method for linear programming","volume":"1","author":"de Ghellinck","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0305-0548(92)90051-6_BIB6","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/BF01840455","article-title":"An extension of Karmarkar's algorithm for linear programming","volume":"1","author":"Todd","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0305-0548(92)90051-6_BIB7","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/0305-0548(92)90051-6_BIB8","first-page":"3088","article-title":"Neurons with graded response have collective computational properties like those of two-state neurons","volume":"81","author":"Hopfield","year":"1984"},{"key":"10.1016\/0305-0548(92)90051-6_BIB9","first-page":"2554","article-title":"Neural networks and physical systems with emergent collective computational ability","volume":"79","author":"Hopfield","year":"1982"},{"key":"10.1016\/0305-0548(92)90051-6_BIB10","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","article-title":"\u2018Neural\u2019 computation of decisions in optimization problems","volume":"52","author":"Hopfield","year":"1985","journal-title":"Biol. Cybernet."},{"key":"10.1016\/0305-0548(92)90051-6_BIB11","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1109\/31.1783","article-title":"Neural networks for nonlinear programming","volume":"35","author":"Kennedy","year":"1988","journal-title":"IEEE Trans. Circuits Syst."},{"key":"10.1016\/0305-0548(92)90051-6_BIB12","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF00363956","article-title":"On the stability of the traveling salesman problem algorithm of Hopfield and Tank","volume":"58","author":"Wilson","year":"1988","journal-title":"Biol. Cybernet."},{"key":"10.1016\/0305-0548(92)90051-6_BIB13","article-title":"Boltzmann machines: constraint satisfaction networks that learn","author":"Hinton","year":"1984"},{"key":"10.1016\/0305-0548(92)90051-6_BIB14","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0377-2217(89)90355-X","article-title":"Boltzmann machines for traveling salesman problems","volume":"39","author":"Aarts","year":"1989","journal-title":"Eur. J. opl Res."},{"key":"10.1016\/0305-0548(92)90051-6_BIB15","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1109\/TCS.1986.1085953","article-title":"Simple neural optimization networks: an A\/D converter, signal decision circuit, and a linear programming circuit","volume":"33","author":"Tank","year":"1986","journal-title":"IEEE Trans. Circuits Syst."},{"key":"10.1016\/0305-0548(92)90051-6_BIB16","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1109\/TCS.1987.1086095","article-title":"Unifying the Tank and Hopfield linear programming circuit and the canonical nonlinear programming circuit of Chua and Lin","volume":"34","author":"Kennedy","year":"1988","journal-title":"IEEE Trans. Circuits Syst."},{"key":"10.1016\/0305-0548(92)90051-6_BIB17","first-page":"293","article-title":"Neural network models for linear programming","volume":"Vol. I","author":"Culioli","year":"1990"},{"key":"10.1016\/0305-0548(92)90051-6_BIB18","first-page":"381","article-title":"A neural network for explicitly bounded linear programming","volume":"Vol. I","author":"Culioli","year":"1990"},{"key":"10.1016\/0305-0548(92)90051-6_BIB19","first-page":"345","article-title":"Programming neural networks: a dynamic-state model","volume":"Vol. I","author":"Yao","year":"1990"},{"key":"10.1016\/0305-0548(92)90051-6_BIB20","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0096-3003(08)80002-1","article-title":"Linear programming and simple associative memory","volume":"40","author":"Kalaba","year":"1990","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/0305-0548(92)90051-6_BIB21","first-page":"941","article-title":"Feasible direction linear programming by neural networks","volume":"Vol. III","author":"Barbosa","year":"1990"},{"key":"10.1016\/0305-0548(92)90051-6_BIB22","first-page":"759","article-title":"Stability of linear programming neural network for problems with hypercube feasible region","volume":"Vol. III","author":"Maa","year":"1990"},{"key":"10.1016\/0305-0548(92)90051-6_BIB23","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1109\/TSMC.1983.6313075","article-title":"Absolute stability of global pattern formation and parallel memory storage by competitive neural networks","volume":"13","author":"Cohen","year":"1983","journal-title":"IEEE Trans. Syst. Man Cybernet."},{"key":"10.1016\/0305-0548(92)90051-6_BIB24","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1109\/21.87056","article-title":"On the stability, storage capacity, and design of nonlinear continuous neural networks","volume":"18","author":"Suez","year":"1988","journal-title":"IEEE Trans. Systems Man Cybernet."},{"key":"10.1016\/0305-0548(92)90051-6_BIB25","series-title":"Proceedings of International Neural Network Conference","first-page":"278","article-title":"A parallel distributed processor for the quadratic assignment problem","author":"Wang","year":"1990"},{"key":"10.1016\/0305-0548(92)90051-6_BIB26","series-title":"Proceedings of IEEE International Conference on Systems, Man, and Cybernetics","first-page":"373","article-title":"A deterministic connectionist machine for the traveling salesman problem","author":"Wang","year":"1990"},{"key":"10.1016\/0305-0548(92)90051-6_BIB27","series-title":"On the trainability, stability, representability and realizability of artificial neural networks","author":"Wang","year":"1991"},{"key":"10.1016\/0305-0548(92)90051-6_BIB28","doi-asserted-by":"crossref","DOI":"10.1142\/S0218001491000338","article-title":"On the asymptotic properties of recurrent neural networks for optimization","author":"Wang","year":"1991","journal-title":"Int. J. Pattern Recog. Artific. Intell."},{"key":"10.1016\/0305-0548(92)90051-6_BIB29","series-title":"Progress in Neural Networks","article-title":"Deterministic neural networks for combinatorial optimization","author":"Wang","year":"1992"},{"key":"10.1016\/0305-0548(92)90051-6_BIB30","series-title":"linear and Nonlinear Programming","author":"Luenberger","year":"1984"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054892900516?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054892900516?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T16:07:22Z","timestamp":1682525242000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054892900516"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":30,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["0305054892900516"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(92)90051-6","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}