{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:41:12Z","timestamp":1740123672668,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T00:00:00Z","timestamp":1612828800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T00:00:00Z","timestamp":1612828800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s11075-021-01075-z","type":"journal-article","created":{"date-parts":[[2021,2,10]],"date-time":"2021-02-10T03:59:27Z","timestamp":1612929567000},"page":"1251-1274","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A neurodynamic approach to zero-one quadratic programming"],"prefix":"10.1007","volume":"88","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3092-9801","authenticated-orcid":false,"given":"Yigui","family":"Ou","sequence":"first","affiliation":[]},{"given":"Haichan","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,9]]},"reference":[{"key":"1075_CR1","volume-title":"Nonlinear Integer Programming","author":"D Li","year":"2006","unstructured":"Li, D, Sun, X: Nonlinear Integer Programming. Springer, New York (2006)"},{"key":"1075_CR2","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1007\/s11590-019-01418-9","volume":"13","author":"S Hosseinian","year":"2019","unstructured":"Hosseinian, S., Butenko, S.: Algorithms for the generalized independent set problem based on a quadratic optimization approach. Optim. Lett. 13, 1211\u20131222 (2019)","journal-title":"Optim. Lett."},{"key":"1075_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BFb0120827","volume":"9","author":"J Krarup","year":"1978","unstructured":"Krarup, J., Pruzan, P.A.: Computer aided layout design. Math. Prog. Study 9, 75\u201394 (1978)","journal-title":"Math. Prog. Study"},{"key":"1075_CR4","doi-asserted-by":"publisher","first-page":"8799","DOI":"10.1007\/s00521-019-04283-w","volume":"32","author":"CT Xu","year":"2020","unstructured":"Xu, C.T., He, X., Huang, T.W., Huang, J.J.: A combined neurodynamic approach to optimize the real-time price-based demand response management problem using mixed zero-one programming. Neural Computing Appl. 32, 8799\u20138809 (2020)","journal-title":"Neural Computing Appl."},{"key":"1075_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s11590-010-0249-z","volume":"6","author":"X He","year":"2012","unstructured":"He, X., Chen, A., Chaovalitwongse, W.A., Lin, H.X.: An improved linearization technique for a class of quadratic 0-1 problems. Optim. Lett. 6, 31\u201341 (2012)","journal-title":"Optim. Lett."},{"key":"1075_CR6","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF02247879","volume":"45","author":"PM Pardalos","year":"1990","unstructured":"Pardalos, P.M., Rodgers, G.: Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing 45, 131\u2013144 (1990)","journal-title":"Computing"},{"key":"1075_CR7","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s11590-014-0768-0","volume":"9","author":"C Lu","year":"2015","unstructured":"Lu, C., Guo, X.: Convex reformulation for binary quadratic programming problems via average objective value maximization. Optim. Lett. 9, 523\u2013535 (2015)","journal-title":"Optim. Lett."},{"key":"1075_CR8","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1080\/02331930108844555","volume":"50","author":"LT Hoai","year":"2001","unstructured":"Hoai, L.T., Tao, P.D.: A continuous approch for globally solving linearly constrained quadratic zero-one programming problems. Optimization 50, 93\u2013120 (2001)","journal-title":"Optimization"},{"key":"1075_CR9","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1023\/A:1022174505886","volume":"116","author":"WX Zhu","year":"2003","unstructured":"Zhu, W.X.: Penalty parameter for linearly constrained 0-1 quadratic programming. J. Optim. Theory Appl. 116, 229\u2013239 (2003)","journal-title":"J. Optim. Theory Appl."},{"key":"1075_CR10","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1016\/j.dam.2007.12.007","volume":"157","author":"A Billionnet","year":"2009","unstructured":"Billionnet, A., Elloumi, S., Plateau, M.C.: Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: the QCR method. Discrete. Appl. Math. 157, 1185\u20131197 (2009)","journal-title":"Discrete. Appl. Math."},{"key":"1075_CR11","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1023\/B:JOGO.0000015310.27011.02","volume":"28","author":"LZ Liao","year":"2004","unstructured":"Liao, L.Z., Qi, H.D., Qi, L.Q.: Neurodynamical Optimization. J. Global Optim. 28, 175\u2013195 (2004)","journal-title":"J. Global Optim."},{"key":"1075_CR12","doi-asserted-by":"publisher","first-page":"1899","DOI":"10.1080\/00207160.2015.1079626","volume":"93","author":"YG Ou","year":"2016","unstructured":"Ou, Y.G., Lin, H.C.: A continuous method model for solving general variational inequality. Inter. J. Comput. Math. 93, 1899\u20131920 (2016)","journal-title":"Inter. J. Comput. Math."},{"key":"1075_CR13","doi-asserted-by":"publisher","first-page":"1206","DOI":"10.1109\/TNNLS.2016.2524619","volume":"28","author":"Z Yan","year":"2017","unstructured":"Yan, Z., Fan, J., Wang, J.: A collective neurodynamic approach to constrained global optimization. IEEE Trans. Neural Netw. Learn. Syst. 28, 1206\u20131215 (2017)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"1075_CR14","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.cam.2017.09.032","volume":"333","author":"A Mansoori","year":"2018","unstructured":"Mansoori, A., Erfanian, M.: A dynamic model to solve the absolute value equations. J. Comput. Appl. Math. 333, 28\u201335 (2018)","journal-title":"J. Comput. Appl. Math."},{"key":"1075_CR15","doi-asserted-by":"crossref","first-page":"1517","DOI":"10.3934\/jimo.2018107","volume":"15","author":"LM Sun","year":"2019","unstructured":"Sun, L.M., Liao, L.Z.: An interior point continuous path-following trajectory for linear programming. J. Ind. Manag. Optimi. 15, 1517\u20131534 (2019)","journal-title":"J. Ind. Manag. Optimi."},{"key":"1075_CR16","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.neunet.2019.02.002","volume":"114","author":"H Che","year":"2019","unstructured":"Che, H., Wang, J.: A collaborative neurodynamic approach to global and combinatorial optimization. Neural Netw. 114, 15\u201327 (2019)","journal-title":"Neural Netw."},{"key":"1075_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TNNLS.2020.3036293","volume":"31","author":"H Che","year":"2020","unstructured":"Che, H., Wang, J.: A two-timescale duplex neurodynamic approach to mixed-integer optimization. IEEE Trans. Neural Netw. Learn. Syst. 31, 1\u201313 (2020)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"1075_CR18","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/j.neunet.2020.06.012","volume":"129","author":"SX Liu","year":"2020","unstructured":"Liu, S.X., Jiang, H.J., Zhang, L.W., Mei, X.H.: A neurodynamic optimization approach for complex-variables programming problem. Neural Netw. 129, 280\u2013287 (2020)","journal-title":"Neural Netw."},{"key":"1075_CR19","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.neucom.2019.10.050","volume":"377","author":"XR Jiang","year":"2020","unstructured":"Jiang, X.R., Qin, S.T., Xue, X.P.: A penalty-like neurodynamic approach to constrained nonsmooth distributed convex optimization. Neurocomputing 377, 225\u2013233 (2020)","journal-title":"Neurocomputing"},{"key":"1075_CR20","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.neucom.2019.01.012","volume":"334","author":"A Mansoori","year":"2019","unstructured":"Mansoori, A., Effati, S.: An efficient neurodynamic model to solve nonlinear programming problems with fuzzy parameters. Neurocomputing 334, 125\u2013133 (2019)","journal-title":"Neurocomputing"},{"key":"1075_CR21","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.cam.2018.10.025","volume":"350","author":"A Nikseresht","year":"2019","unstructured":"Nikseresht, A., Nazemi, A.: A novel neural network for solving semidefinite programming problems with some applications. J. Comput. Appl. Math. 350, 309\u2013323 (2019)","journal-title":"J. Comput. Appl. Math."},{"key":"1075_CR22","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1109\/ICNN.1993.298710","volume":"2","author":"M Aourid","year":"1993","unstructured":"Aourid, M., Do, X.D., Kaminska, B.: Penalty formulation for 0-1 linear programming problem: a neural network approach. IEEE Neural Netw. 2, 1092\u20131095 (1993)","journal-title":"IEEE Neural Netw."},{"key":"1075_CR23","first-page":"1690","volume":"4","author":"M Aourid","year":"1995","unstructured":"Aourid, M., Kaminska, B.: Neural networks for solving the quadratic 0-1 programming problem under linear constraints. IEEE Neural Netw. 4, 1690\u20131693 (1995)","journal-title":"IEEE Neural Netw."},{"key":"1075_CR24","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.neucom.2016.12.064","volume":"235","author":"M Ranjbar","year":"2017","unstructured":"Ranjbar, M., Effati, S., Miri, S.M.: An artificial neural network for solving quadratic zero-one programming problems. Neurocomputing 235, 192\u2013198 (2017)","journal-title":"Neurocomputing"},{"key":"1075_CR25","volume-title":"Nonlinear Complementarity: Theory and Algorithm","author":"JY Han","year":"2006","unstructured":"Han, J.Y., Xiu, N.H., Qi, H.D.: Nonlinear Complementarity: Theory and Algorithm. Shanghai Science and Technology Press, Shanghai (2006)"},{"key":"1075_CR26","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (2006)"},{"key":"1075_CR27","volume-title":"Applied Nonlinear Control","author":"JJE Slotine","year":"1991","unstructured":"Slotine, J.J.E., Li, W.: Applied Nonlinear Control. Prentice-Hall, Englewood Cliffs (1991)"},{"key":"1075_CR28","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1109\/82.160169","volume":"39","author":"SW Zhang","year":"1992","unstructured":"Zhang, S.W., Constantinides, A.G.: Lagrange programming neural networks. IEEE Trans. Circuits Syst. 39, 441\u2013452 (1992)","journal-title":"IEEE Trans. Circuits Syst."},{"key":"1075_CR29","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1023\/A:1011245911067","volume":"19","author":"QM Han","year":"2001","unstructured":"Han, Q.M., Liao, L.Z., Qi, H.D., Q, L.Q.: Stability analysis of gradient-based neural networks for optimization problems. J. Global Optim. 19, 363\u2013381 (2001)","journal-title":"J. Global Optim."},{"key":"1075_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0015-5","volume-title":"Introduction to Global Optimization","author":"R Horst","year":"2000","unstructured":"Horst, R., Pardalos, P.M., Thoai, N.V.: Introduction to Global Optimization. Kluwer Academic Publishers, 2 (2000)"},{"key":"1075_CR31","volume-title":"Fundamentals and Applications of Operations Research","author":"YQ Hu","year":"2004","unstructured":"Hu, Y.Q.: Fundamentals and Applications of Operations Research, 4th edn. Higher Education Press, Beijing (2004)","edition":"4th edn."},{"key":"1075_CR32","volume-title":"Linear Programming and Network Flows","author":"MS Bazaraa","year":"1990","unstructured":"Bazaraa, M.S., Jarvis, J.J., Sherali, H.D.: Linear Programming and Network Flows. Wiley, New York (1990)"},{"key":"1075_CR33","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.cam.2016.12.020","volume":"319","author":"F Omidi","year":"2017","unstructured":"Omidi, F., Abbasi, B., Nazemi, A.: An efficient dynamic model for solving a portfolio selection with uncertain chance constraint models. J. Comput. Appl. Math. 319, 43\u201355 (2017)","journal-title":"J. Comput. Appl. Math."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-021-01075-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-021-01075-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-021-01075-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,16]],"date-time":"2022-12-16T06:15:26Z","timestamp":1671171326000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-021-01075-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,9]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["1075"],"URL":"https:\/\/doi.org\/10.1007\/s11075-021-01075-z","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2021,2,9]]},"assertion":[{"value":"8 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}