{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T16:25:06Z","timestamp":1775579106641,"version":"3.50.1"},"reference-count":21,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Circuits Syst. II"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1109\/tcsii.2020.2977862","type":"journal-article","created":{"date-parts":[[2020,3,3]],"date-time":"2020-03-03T21:39:01Z","timestamp":1583271541000},"page":"2747-2751","source":"Crossref","is-referenced-by-count":4,"title":["Projection Recurrent Neural Network Model: A New Strategy to Solve Maximum Flow Problem"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6720-0611","authenticated-orcid":false,"given":"Mohammad","family":"Eshaghnezhad","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9752-0034","authenticated-orcid":false,"given":"Sohrab","family":"Effati","sequence":"additional","affiliation":[]},{"given":"Freydoon","family":"Rahbarnia","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2013.07.017"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2019.01.012"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2017.2750065"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2017.09.032"},{"key":"ref14","author":"khalil","year":"1996","journal-title":"Nonlinear Systems"},{"key":"ref15","author":"luenberger","year":"1984","journal-title":"Linear and Nonlinear Programming"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-014-0553-3"},{"key":"ref17","author":"nagurney","year":"2002","journal-title":"Variational Inequalities"},{"key":"ref18","author":"facchinei","year":"2003","journal-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2012.03.001"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.ejor.2010.10.018","article-title":"A specialized network simplex algorithm for the constrained maximum flow problem","volume":"210","author":"\u00e7ali?kan","year":"2011","journal-title":"Eur J Oper Res"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1002\/net.20263","article-title":"On a capacity scaling algorithm for the constrained maximum flow problem","volume":"53","author":"\u00e7ali?kan","year":"2009","journal-title":"Networks"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2500618"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","article-title":"Neural computation of decisions in optimization problems","volume":"52","author":"hopfield","year":"1985","journal-title":"Biol Cybern"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2015.05.003"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2885825"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1016\/j.cor.2006.07.009","article-title":"A double scaling algorithm for the constrained maximum flow problem","volume":"35","author":"\u00e7ali?kan","year":"2008","journal-title":"Comput Oper Res"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230250207"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2611529"},{"key":"ref20","first-page":"488","article-title":"A genetic algorithm applied to the maximum flow problem","author":"munakata","year":"1993","journal-title":"Proc of 5th International Conference on Genetic Algorithms"},{"key":"ref21","first-page":"159","article-title":"A parallel genetic algorithm for maximum flow problem","volume":"8","author":"surakhi","year":"2017","journal-title":"Int J Adv Comput Sci Appl"}],"container-title":["IEEE Transactions on Circuits and Systems II: Express Briefs"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8920\/9242338\/09023487.pdf?arnumber=9023487","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T11:27:52Z","timestamp":1666006072000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9023487\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11]]},"references-count":21,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tcsii.2020.2977862","relation":{},"ISSN":["1549-7747","1558-3791"],"issn-type":[{"value":"1549-7747","type":"print"},{"value":"1558-3791","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11]]}}}