{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:29:03Z","timestamp":1743154143984,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030041786"},{"type":"electronic","value":"9783030041793"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04179-3_51","type":"book-chapter","created":{"date-parts":[[2018,11,17]],"date-time":"2018-11-17T07:12:42Z","timestamp":1542438762000},"page":"577-587","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Neural Network Based Global Optimal Algorithm for Unconstrained Binary Quadratic Programming Problem"],"prefix":"10.1007","author":[{"given":"Shenshen","family":"Gu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinyi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,18]]},"reference":[{"key":"51_CR1","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":"51_CR2","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":"51_CR3","first-page":"704","volume":"41","author":"P Chardaire","year":"1995","unstructured":"Chardaire, P., Sutter, A.: A decomposition method for quadratic zero-one programming. J. Manage. Sci. 41, 704\u2013712 (1995)","journal-title":"J. Manage. Sci."},{"key":"51_CR4","doi-asserted-by":"publisher","unstructured":"Li, D., Sun, X.L.: Nonlinear Integer Programming. Springer, New York (2006). https:\/\/doi.org\/10.1007\/0-387-32995-1","DOI":"10.1007\/0-387-32995-1"},{"key":"51_CR5","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":"51_CR6","unstructured":"Rendl, F., Rinaldi, G., Wiegele, A.: Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxation. Lecture Notes Computer Science, vol. 4513, pp. 295\u2013309 (2007)"},{"key":"51_CR7","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"},{"issue":"1-3","key":"51_CR8","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":"Mathematical Programming"},{"key":"51_CR9","unstructured":"Boros, E., Hammer, P.L., Tavares, G.: Local search heuristics for unconstrained quadratic binary optimization. Technical report, RUTCOR, Rutgers University, Rut-cor Research Report (2005)"},{"key":"51_CR10","unstructured":"Li, D., Sun, X.L., Liu, C.L.: An exact solution method for quadratic 0\u20131 programming: a geometric approach. Technical report, Chinese University of Hong Kong, Department of Systems Engineering and Engineering Management (2006)"},{"key":"51_CR11","doi-asserted-by":"crossref","unstructured":"Gu, S., Peng, J.: A neural network based algorithm to compute the distance between a point and an ellipsoid. In: 2015 Seventh International Conference on Advanced Computational Intelligence (ICACI), pp. 294\u2013299. IEEE (2015)","DOI":"10.1109\/ICACI.2015.7184717"},{"key":"51_CR12","doi-asserted-by":"crossref","unstructured":"Gu, S., Peng, J., Zhang, J.: A projection based recurrent neural network approach to compute the distance between a point and an ellipsoid with box constraint. In: Youth Academic Annual Conference of Chinese Association of Automation (YAC), pp. 459\u2013462. IEEE (2016)","DOI":"10.1109\/YAC.2016.7804938"},{"issue":"11","key":"51_CR13","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"Jin Y. Yen","year":"1971","unstructured":"Yen, Y.: Finding the K shortest loopless paths in a network. Manag. Sci. 17(11), 712\u2013716 (1971)","journal-title":"Management Science"},{"issue":"1","key":"51_CR14","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"Richard Bellman","year":"1958","unstructured":"Bellman, R.: On a routing problem. Quart. Appl. Math. 16, 87\u201390 (1958)","journal-title":"Quarterly of Applied Mathematics"},{"key":"51_CR15","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.neucom.2013.12.063","volume":"149","author":"Shenshen Gu","year":"2015","unstructured":"Gu, S., Cui, R.: An efficient algorithm for the subset sum problem based on finite-time convergent recurrent neural network. Neurocomputing 149, 13 (2014)","journal-title":"Neurocomputing"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04179-3_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:31:42Z","timestamp":1709825502000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04179-3_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030041786","9783030041793"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04179-3_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"18 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Siem Reap","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cambodia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.cs.cityu.edu.hk\/iconip\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"575","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"401","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"70% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}