{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:31:12Z","timestamp":1742934672108,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319124353"},{"type":"electronic","value":"9783319124360"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12436-0_38","type":"book-chapter","created":{"date-parts":[[2014,11,21]],"date-time":"2014-11-21T13:16:45Z","timestamp":1416575805000},"page":"338-346","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Polynomial Time Solvable Algorithm to Binary Quadratic Programming Problems with Q Being a Seven-Diagonal Matrix and Its Neural Network Implementation"],"prefix":"10.1007","author":[{"given":"Shenshen","family":"Gu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiao","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,19]]},"reference":[{"key":"38_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-85823-9","volume-title":"Boolean Methods in Operations Research and Related Areas","author":"PL Hammer","year":"1968","unstructured":"Hammer, P.L., Rudeanu, S.: Boolean Methods in Operations Research and Related Areas. Springer, Heidelberg (1968)"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0166-218X(90)90142-Y","volume":"29","author":"Y Crama","year":"1990","unstructured":"Crama, Y., Hansen, P., Jaumard, B.: The basic algorithm for pseudo-Booleab programming revisited. Discrete Appl. Math. 29, 171\u2013185 (1990)","journal-title":"Discrete Appl. Math."},{"key":"38_CR3","volume-title":"Nonlinear Integer Programming","author":"D Li","year":"2006","unstructured":"Li, D., Sun, X.L.: Nonlinear Integer Programming. Springer, New York (2006)"},{"key":"38_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman. Co., New York (1979)"},{"key":"38_CR5","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1287\/mnsc.26.3.282","volume":"26","author":"RD Mcbride","year":"1980","unstructured":"Mcbride, R.D., Yormark, J.S.: An implicit enumeration algorithm for quadratic integer programming. Manage. Sci. 26, 282\u2013296 (1980)","journal-title":"Manage. Sci."},{"key":"38_CR6","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF01096724","volume":"4","author":"AT Phillips","year":"1994","unstructured":"Phillips, A.T., Rosen, J.B.: A quadratic assignment formulation of the molecular conformation problem. J. Global Optim. 4, 229\u2013241 (1994)","journal-title":"J. Global Optim."},{"key":"38_CR7","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1287\/mnsc.41.4.704","volume":"41","author":"P Chardaire","year":"1995","unstructured":"Chardaire, P., Sutter, A.: A decomposition method for quadratic zero-one programming. Manage. Sci. 41, 704\u2013712 (1995)","journal-title":"Manage. Sci."},{"key":"38_CR8","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/BF01585184","volume":"62","author":"C Delorme","year":"1993","unstructured":"Delorme, C., Poljak, S.: Laplacian eigenvalues and the maximum cut problem. Math. Program 62, 557\u2013574 (1993)","journal-title":"Math. Program"},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. Assoc., Comput, Mach., 42, 1115\u20131145 (1995)","DOI":"10.1145\/227683.227684"},{"key":"38_CR10","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1287\/mnsc.41.4.704","volume":"41","author":"P Chardaire","year":"1995","unstructured":"Chardaire, P., Sutter, A.: A decomposition method for quadratic zero-one programming. Manage, Sci. 41, 704\u2013712 (1995)","journal-title":"Manage, Sci."},{"key":"38_CR11","first-page":"291","volume":"82","author":"C Helmberg","year":"1998","unstructured":"Helmberg, C., Rendl, F.: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes. Math. Program 82, 291\u2013315 (1998)","journal-title":"Math. Program"},{"key":"38_CR12","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-540-72792-7_23","volume":"4513","author":"F Rendl","year":"2007","unstructured":"Rendl, F., Rinaldi, G., Wiegele, A.: Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations. Lecture Notes Comput, Sci. 4513, 295\u2013309 (2007)","journal-title":"Lecture Notes Comput, Sci."},{"key":"38_CR13","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF02247879","volume":"45","author":"PM Pardalos","year":"1990","unstructured":"Pardalos, P.M., Rodgers, G.P.: Computational aspects of a branch-and-bound algorithm for quadratic zero-one programming. Computing 45, 131\u2013144 (1990)","journal-title":"Computing"},{"key":"38_CR14","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01587084","volume":"44","author":"F Barahona","year":"1989","unstructured":"Barahona, F.: J$${\\rm\\ddot{u}}$$nger, M., Reinelt, G.: Experiments in quadratic 0\u20131 programming. Math. Program 44, 127\u2013137 (1989)","journal-title":"Math. Program"},{"key":"38_CR15","doi-asserted-by":"crossref","unstructured":"Gu, S.: Polynomial time solvable algorithm to binary quadratic programming problems with Q being a tri-diagonal or five-diagonal matrix. In: Proceedings of 2010 International Conference on Wireless Communication and Signal Processing (2010)","DOI":"10.1109\/WCSP.2010.5632199"},{"key":"38_CR16","doi-asserted-by":"crossref","unstructured":"Gu, S.: A Polynomial time solvable algorithm to linearly constrained binary quadratic programming problems with Q being a tri-diagonal. Advance in Information Science and Service Sciences 3(6) (July 2011)","DOI":"10.4156\/aiss.vol3.issue6.8"},{"key":"38_CR17","first-page":"981","volume-title":"Toward massively parallel automatic test generation","author":"ST Chakradhar","year":"1990","unstructured":"Chakradhar, S.T., Bushnell, M.L., Agrawal, V.D.: Toward massively parallel automatic test generation, pp. 981\u2013994. IEEE Trans, Computer-Aided (1990)"},{"key":"38_CR18","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0166-218X(92)90256-A","volume":"36","author":"ST Chakradhar","year":"1992","unstructured":"Chakradhar, S.T., Bushnell, M.L.: A solvable class of quadratic 0\u20131 programming. Discrete Applied Mathemetics 36, 233\u2013551 (1992)","journal-title":"Discrete Applied Mathemetics"}],"container-title":["Lecture Notes in Computer Science","Advances in Neural Networks \u2013 ISNN 2014"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12436-0_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T03:37:16Z","timestamp":1676000236000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12436-0_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319124353","9783319124360"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12436-0_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"19 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}