{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T16:39:39Z","timestamp":1725986379793},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319968056"},{"type":"electronic","value":"9783319968063"}],"license":[{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"unspecified","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":[[2019]]},"DOI":"10.1007\/978-3-319-96806-3_3","type":"book-chapter","created":{"date-parts":[[2018,7,31]],"date-time":"2018-07-31T17:49:13Z","timestamp":1533059353000},"page":"27-47","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Branch-and-Bound Based Exact Algorithm for the Maximum Edge-Weight Clique Problem"],"prefix":"10.1007","author":[{"given":"Satoshi","family":"Shimizu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuaki","family":"Yamaguchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sumio","family":"Masuda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,1]]},"reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1016\/j.ejor.2006.06.035","volume":"181","author":"B Alidaee","year":"2007","unstructured":"Alidaee, B., Glover, F., Kochenberger, G., Wang, H.: Solving the maximum edge weight clique problem via unconstrained quadratic programming. Eur. J. Oper. Res. 181(2), 592\u2013597 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"3_CR2","first-page":"73","volume":"34","author":"R Aringhieri","year":"2009","unstructured":"Aringhieri, R., Bruglieri, M., Cordone, R.: Optimal results and tight bounds for the maximum diversity problem. Found. Comput. Decis. Sci. 34(2), 73 (2009)","journal-title":"Found. Comput. Decis. Sci."},{"unstructured":"Bahadur, K., Akutsu, T., Tomita, E., Seki, T.: Protein side-chain packing problem: a maximum edge-weight clique algorithmic approach. In: The Second Conference on Asia-Pacific Bioinformatics, vol. 29, pp. 191\u2013200. Australian Computer Society, Inc. (2004)","key":"3_CR3"},{"issue":"2","key":"3_CR4","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s10878-012-9592-6","volume":"27","author":"M Batsyn","year":"2014","unstructured":"Batsyn, M., Goldengorin, B., Maslov, E., Pardalos, P.M.: Improvements to MCS algorithm for the maximum clique problem. J. Comb. Optim. 27(2), 397\u2013416 (2014)","journal-title":"J. Comb. Optim."},{"issue":"3","key":"3_CR5","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1023\/A:1011275112159","volume":"23","author":"GT Bogdanova","year":"2001","unstructured":"Bogdanova, G.T., Brouwer, A.E., Kapralov, S.N., \u00d6sterg\u00e5rd, P.R.: Error-correcting codes over an alphabet of four elements. Des. Codes Cryptogr. 23(3), 333\u2013342 (2001)","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"3_CR6","first-page":"3","volume":"17","author":"J Brown","year":"2006","unstructured":"Brown, J., Dukka Bahadur, K., Tomita, E., Akutsu, T.: Multiple methods for protein side chain packing using maximum weight cliques. Genome Inf. 17(1), 3\u201312 (2006)","journal-title":"Genome Inf."},{"unstructured":"Brown, K.L.: Combinatorial auction test suite (CATS) (2000). \nhttp:\/\/www.cs.ubc.ca\/~kevinlb\/CATS\/","key":"3_CR7"},{"issue":"6","key":"3_CR8","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1016\/j.jretconser.2007.02.003","volume":"14","author":"L Cavique","year":"2007","unstructured":"Cavique, L.: A scalable algorithm for the market basket analysis. J. Retail. Consum. Serv. 14(6), 400\u2013407 (2007)","journal-title":"J. Retail. Consum. Serv."},{"issue":"2","key":"3_CR9","first-page":"157","volume":"28","author":"SR Corman","year":"2002","unstructured":"Corman, S.R., Kuhn, T., McPhee, R.D., Dooley, K.J.: Studying complex discursive systems. Hum. Commun. Res. 28(2), 157\u2013206 (2002)","journal-title":"Hum. Commun. Res."},{"unstructured":"Corman, S.R., et\u00a0al.: Pajek datasets: reuters terror news network. \nhttp:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/CRA\/terror.htm","key":"3_CR10"},{"key":"3_CR11","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."},{"unstructured":"Gary, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company (1979)","key":"3_CR12"},{"issue":"1","key":"3_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13675-014-0028-1","volume":"3","author":"L Gouveia","year":"2015","unstructured":"Gouveia, L., Martins, P.: Solving the maximum edge-weight clique problem in sparse graphs with compact formulations. Eur. J. Comput. Optim. 3(1), 1\u201330 (2015)","journal-title":"Eur. J. Comput. Optim."},{"issue":"11","key":"3_CR14","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1109\/34.42855","volume":"11","author":"R Horaud","year":"1989","unstructured":"Horaud, R., Skordas, T.: Stereo correspondence through feature grouping and maximal cliques. IEEE Trans. Pattern Anal. Mach. Intell. 11(11), 1168\u20131180 (1989)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"3_CR15","first-page":"143","volume":"13","author":"DB Kc","year":"2002","unstructured":"Kc, D.B., Akutsu, T., Tomita, E., Seki, T., Fujiyama, A.: Point matching under non-uniform distortions and protein side chain packing based on efficient maximum clique algorithms. Genome Inf. 13, 143\u2013152 (2002)","journal-title":"Genome Inf."},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2017.02.017","volume":"84","author":"CM Li","year":"2017","unstructured":"Li, C.M., Jiang, H., Many\u00e0, F.: On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem. Comput. Oper. Res. 84, 1\u201315 (2017)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.ejor.2008.12.023","volume":"200","author":"R Mart\u00ed","year":"2010","unstructured":"Mart\u00ed, R., Gallego, M., Duarte, A.: A branch and bound algorithm for the maximum diversity problem. Eur. J. Oper. Res. 200(1), 36\u201344 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"3_CR18","first-page":"206","volume-title":"Lecture Notes in Computer Science","author":"Ciaran McCreesh","year":"2017","unstructured":"McCreesh, C., Prosser, P., Simpson, K., Trimble, J.: On maximum weight clique algorithms, and how they are evaluated. In: International Conference on Principles and Practice of Constraint Programming, pp. 206\u2013225. Springer (2017)"},{"issue":"4","key":"3_CR19","first-page":"424","volume":"8","author":"PR \u00d6sterg\u00e5rd","year":"2001","unstructured":"\u00d6sterg\u00e5rd, P.R.: A new algorithm for the maximum-weight clique problem. Nordic J. Comput. 8(4), 424\u2013436 (2001)","journal-title":"Nordic J. Comput."},{"issue":"3","key":"3_CR20","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/0377-2217(95)00299-5","volume":"95","author":"K Park","year":"1996","unstructured":"Park, K., Lee, K., Park, S.: An extended formulation approach to the edge-weighted maximal clique problem. Eur. J. Oper. Res. 95(3), 671\u2013682 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"3_CR21","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s10732-007-9026-2","volume":"14","author":"W Pullan","year":"2008","unstructured":"Pullan, W.: Approximating the maximum vertex\/edge weighted clique using local search. J. Heuristics 14(2), 117\u2013134 (2008)","journal-title":"J. Heuristics"},{"issue":"2","key":"3_CR22","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/j.cor.2010.07.019","volume":"38","author":"P San Segundo","year":"2011","unstructured":"San Segundo, P., Rodr\u00edguez-Losada, D., Jim\u00e9nez, A.: An exact bit-parallel algorithm for the maximum clique problem. Comput. Oper. Res. 38(2), 571\u2013581 (2011)","journal-title":"Comput. Oper. Res."},{"unstructured":"Shimizu, S., Yamaguchi, K., Masuda, S.: Mathematical programming formulation for the maximum edge-weight clique problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (in Japanese) J100-A(8), 313\u2013315 (2017)","key":"3_CR23"},{"key":"3_CR24","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. Descr. Appl. Math. 223, 120\u2013134 (2017)","journal-title":"Descr. Appl. Math."},{"issue":"1","key":"3_CR25","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0377-2217(02)00852-4","volume":"154","author":"MM S\u00f8rensen","year":"2004","unstructured":"S\u00f8rensen, M.M.: New facets and a branch-and-cut algorithm for the weighted clique problem. Eur. J. Oper. Res. 154(1), 57\u201370 (2004)","journal-title":"Eur. J. Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Sorour, S., Valaee, S.: Minimum broadcast decoding delay for generalized instantly decodable network coding. In: Global Telecommunications Conference (GLOBECOM 2010), pp. 1\u20135. IEEE (2010)","key":"3_CR26","DOI":"10.1109\/GLOCOM.2010.5683677"},{"issue":"1","key":"3_CR27","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10898-006-9039-7","volume":"37","author":"E Tomita","year":"2007","unstructured":"Tomita, E., Kameda, T.: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. J. Glob. Optim. 37(1), 95\u2013111 (2007)","journal-title":"J. Glob. Optim."},{"key":"3_CR28","first-page":"215","volume-title":"Frontiers in Algorithmics","author":"Etsuji Tomita","year":"2016","unstructured":"Tomita, E., Yoshida, K., Hatta, T., Nagao, A., Ito, H., Wakatsuki, M.: A much faster branch-and-bound algorithm for finding a maximum clique. In: International Workshop on Frontiers in Algorithmics, pp. 215\u2013226. Springer (2016)"},{"unstructured":"Trick, M., Chvatal, V., Cook, B., Johnson, D., McGeoch, C., Tarjan, B., et\u00a0al.: DIMACS implementation challenges. \nhttp:\/\/dimacs.rutgers.edu\/Challenges\/","key":"3_CR29"},{"unstructured":"Yamaguchi, K., Masuda, S.: A new exact algorithm for the maximum weight clique problem. In: 23rd International Conference on Circuits\/Systems, Computers and Communications (ITC-CSCC08), pp. 317\u2013320 (2008)","key":"3_CR30"}],"container-title":["Studies in Computational Intelligence","Computational Science\/Intelligence & Applied Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96806-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,31]],"date-time":"2018-07-31T17:50:17Z","timestamp":1533059417000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-96806-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,1]]},"ISBN":["9783319968056","9783319968063"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96806-3_3","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2018,8,1]]}}}