{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:37:05Z","timestamp":1742913425888,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030522483"},{"type":"electronic","value":"9783030522490"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-52249-0_9","type":"book-chapter","created":{"date-parts":[[2020,7,3]],"date-time":"2020-07-03T11:03:49Z","timestamp":1593774229000},"page":"122-136","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Finding the Maximal Independent Sets of a Graph Including the Maximum Using a Multivariable Continuous Polynomial Objective Optimization Formulation"],"prefix":"10.1007","author":[{"given":"Maher","family":"Heal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingpeng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,4]]},"reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"PR \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd, P.R.: A fast algorithm for the maximum clique problem. Discrete Appl. Math. 120(1), 197\u2013207 (2002)","journal-title":"Discrete Appl. Math."},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1613\/jair.4953","volume":"55","author":"Z Fang","year":"2016","unstructured":"Fang, Z., Li, C.-M., Xu, K.: An exact algorithm based on maxsat reasoning for the maximum weight clique problem. J. Artif. Intell. Res. 55, 799\u2013833 (2016)","journal-title":"J. Artif. Intell. Res."},{"key":"9_CR3","unstructured":"Tavares, W.A., Neto, M.B.C., Rodrigues, C.D., Michelon, P.: Um algoritmo de branch and bound para o problema da clique m\u00e1xima ponderada. In: Proceedings of XLVII SBPO, vol. 1 (2015)"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.dam.2017.01.026","volume":"223","author":"S Shimizu","year":"2017","unstructured":"Shimizu, S., Yamaguchi, K., Saitoh, T., Masuda, S.: Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound. Discrete Appl. Math. 223, 120\u2013134 (2017)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF02283692","volume":"25","author":"NZ Shor","year":"1990","unstructured":"Shor, N.Z.: Dual quadratic estimates in polynomial and Boolean programming. Ann. Oper. Res. 25(1), 163\u2013168 (1990)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"9_CR6","doi-asserted-by":"publisher","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"TS Motzkin","year":"1965","unstructured":"Motzkin, T.S., Straus, E.G.: Maxima for graphs and a new proof of a theorem of Tur\u00e1n. Can. J. Math. 17(4), 533\u2013540 (1965)","journal-title":"Can. J. Math."},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.7151\/dmgt.1107","volume":"20","author":"J Harant","year":"2000","unstructured":"Harant, J.: Some news about the independence number of a graph. Discussiones Math. Graph Theory 20(1), 71\u201379 (2000)","journal-title":"Discussiones Math. Graph Theory"},{"key":"9_CR8","first-page":"1","volume":"11","author":"J Harant","year":"1993","unstructured":"Harant, J., Pruchnewski, A., Voigt, M.: On dominating sets and independent sets of graphs. Comb. Probab. Comput. 11, 1\u201310 (1993)","journal-title":"Comb. Probab. Comput."},{"key":"9_CR9","unstructured":"Pardalos, P., Gibbons, L., Hearn, D.: A continuous based heuristic for the maximum clique problem. Technical Report, University of Michigan, Ann Arbor, MI, United States (1994)"},{"issue":"4","key":"9_CR10","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s11276-005-1769-9","volume":"11","author":"K Jain","year":"2005","unstructured":"Jain, K., Padhye, J., Padmanabhan, V.N., Qiu, L.: Impact of interference on multi-hop wireless network performance. Wireless Netw. 11(4), 471\u2013487 (2005)","journal-title":"Wireless Netw."},{"key":"9_CR11","unstructured":"https:\/\/hog.grinvin.org\/"},{"key":"9_CR12","unstructured":"https:\/\/uk.mathworks.com\/matlabcentral\/fileexchange\/30413-bron-kerbosch-maximal-clique-finding-algorithm"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Eppstein, D., L\u00f6ffler, M., Strash, D.: Listing all maximal cliques in sparse graphs in near-optimal time. In: International Symposium on Algorithms and Computation, pp. 403\u2013414. Springer (2010)","DOI":"10.1007\/978-3-642-17517-6_36"},{"key":"9_CR14","unstructured":"http:\/\/iridia.ulb.ac.be\/~fmascia\/maximum_clique\/"},{"key":"9_CR15","unstructured":"https:\/\/users.aalto.fi\/~pat\/cliquer.html"}],"container-title":["Advances in Intelligent Systems and Computing","Intelligent Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-52249-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,3]],"date-time":"2020-07-03T23:26:13Z","timestamp":1593818773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-52249-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030522483","9783030522490"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-52249-0_9","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Science and Information Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sai2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/saiconference.com\/Computing","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}