{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T19:10:37Z","timestamp":1725822637246},"publisher-location":"Cham","reference-count":5,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319190839"},{"type":"electronic","value":"9783319190846"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19084-6_26","type":"book-chapter","created":{"date-parts":[[2015,5,28]],"date-time":"2015-05-28T14:43:01Z","timestamp":1432824181000},"page":"268-274","source":"Crossref","is-referenced-by-count":7,"title":["Incremental MaxSAT Reasoning to Reduce Branches in a Branch-and-Bound Algorithm for MaxClique"],"prefix":"10.1007","author":[{"given":"Chu-Min","family":"Li","sequence":"first","affiliation":[]},{"given":"Hua","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Ru-Chu","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,29]]},"reference":[{"key":"26_CR1","first-page":"569","volume":"58","author":"J Konc","year":"2007","unstructured":"Konc, J., Janezic, D.: An improved branch and bound algorithm for the maximum clique problem. Commun. Math. Comput. Chem. 58, 569\u2013590 (2007)","journal-title":"Commun. Math. Comput. Chem."},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Li, C.M., Fang, Z.W., Xu, K.: Combining MaxSAT reasoning and incremental upper bound for the maximum clique problem. In: Proceedings of the 2013 IEEE 25th International Conference on Tools with Artificial Intelligence (ICTAI2013), pp. 939\u2013946 (2013)","DOI":"10.1109\/ICTAI.2013.143"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Li, C.M., Quan, Z.: An efficient branch-and-bound algorithm based on maxsat for the maximum clique problem. In: Proceedings of the 24th AAAI, pp. 128\u2013133 (2010)","DOI":"10.1609\/aaai.v24i1.7536"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Li, C.M., Quan, Z.: Combining graph structure exploitation and propositional reasoning for the maximum clique problem. In: Proceedings of the 22th ICTAI, pp. 344\u2013351 (2010)","DOI":"10.1109\/ICTAI.2010.57"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-11440-3_18","volume-title":"WALCOM: Algorithms and Computation","author":"E Tomita","year":"2010","unstructured":"Tomita, E., Sutani, Y., Higashi, T., Takahashi, S., Wakatsuki, M.: A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique. In: Rahman, M.S., Fujita, S. (eds.) WALCOM 2010. LNCS, vol. 5942, pp. 191\u2013203. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19084-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,10]],"date-time":"2023-08-10T23:04:29Z","timestamp":1691708669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-19084-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319190839","9783319190846"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19084-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}