{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T13:28:09Z","timestamp":1773149289520,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,5,16]],"date-time":"2013-05-16T00:00:00Z","timestamp":1368662400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1007\/s10898-013-0075-9","type":"journal-article","created":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T11:16:31Z","timestamp":1368616591000},"page":"1-21","source":"Crossref","is-referenced-by-count":26,"title":["Speeding up branch and bound algorithms for solving the maximum clique problem"],"prefix":"10.1007","volume":"59","author":[{"given":"Evgeny","family":"Maslov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikhail","family":"Batsyn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,5,16]]},"reference":[{"issue":"4","key":"75_CR1","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/s10732-012-9196-4","volume":"18","author":"DV Andrade","year":"2012","unstructured":"Andrade, D.V., Resende, M.G.C., Werneck, R.F.: Fast local search for the maximum independent set problem. J. Heuristics 18(4), 525\u2013547 (2012). doi: 10.1007\/s10732-012-9196-4","journal-title":"J. Heuristics"},{"issue":"4","key":"75_CR2","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1137\/0215075","volume":"15","author":"E Balas","year":"1986","unstructured":"Balas, E., Yu, C.S.: Finding a maximum clique in an arbitrary graph. SIAM J. Comput. 15(4), 1054\u20131068 (1986)","journal-title":"SIAM J. Comput."},{"key":"75_CR3","unstructured":"Bertoni, A., Campadelli, P., Grossi, G.: A discrete neural algorithm for the maximum clique problem: analysis and circuit implementation. In: Proceedings of Workshop on Algorithm, Engineering, WAE\u201997, pp. 84\u201391 (1997)"},{"key":"75_CR4","doi-asserted-by":"crossref","unstructured":"Boginski, V., Butenko, S., Pardalos, P.M.: On structural properties of the market graph. In: Nagurney, A. (ed.) Innovations in Financial and Economic Networks, pp 29\u201345. Edward Elgar Publishing, London (2003)","DOI":"10.4337\/9781035304998.00010"},{"key":"75_CR5","volume-title":"The Maximum Clique Problem. Handbook of Combinatorial Optimization","author":"I Bomze","year":"1999","unstructured":"Bomze, I., Budinich, M., Pardalos, P.M., Pelillo, M.: The Maximum Clique Problem. Handbook of Combinatorial Optimization. Kluwer, Dordrecht (1999)"},{"issue":"9","key":"75_CR6","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575\u2013577 (1973). doi: 10.1145\/362342.362367","journal-title":"Commun. ACM"},{"issue":"6","key":"75_CR7","doi-asserted-by":"crossref","first-page":"1334","DOI":"10.1109\/18.59932","volume":"36","author":"A Brouwer","year":"1990","unstructured":"Brouwer, A., Shearer, J., Sloane, N., Smith, W.: A new table of constant weight codes. IEEE Trans. Inf. Theory 36(6), 1334\u20131380 (1990). doi: 10.1109\/18.59932","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"75_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2005.05.026","volume":"173","author":"S Butenko","year":"2006","unstructured":"Butenko, S., Wilhelm, W.E.: Clique-detection models in computational biochemistry and genomics. Eur. J. Oper. Res. 173(1), 1\u201317 (2006). doi: 10.1016\/j.ejor.2005.05.026","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"75_CR9","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R Carraghan","year":"1990","unstructured":"Carraghan, R., Pardalos, P.M.: An exact algorithm for the maximum clique problem. Oper. Res. Lett. 9(6), 375\u2013382 (1990). doi: 10.1016\/0167-6377(90)90057-C","journal-title":"Oper. Res. Lett."},{"key":"75_CR10","doi-asserted-by":"crossref","unstructured":"Du, D., Pardalos, P.M.: Handbook of Combinatorial Optimization, Supplement vol A, p. 648. Springer, Berlin (1999)","DOI":"10.1007\/978-1-4613-0303-9"},{"key":"75_CR11","doi-asserted-by":"crossref","unstructured":"Fahle, T.: Simple and fast: improving a branch-and-bound algorithm for maximum clique. In: Proceedings of the 10th Annual European Symposium on Algorithms (ESA \u201902), pp 485\u2013498. Springer, London, UK (2002)","DOI":"10.1007\/3-540-45749-6_44"},{"issue":"2","key":"75_CR12","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6(2), 109\u2013133 (1995). doi: 10.1007\/BF01096763","journal-title":"J. Glob. Optim."},{"key":"75_CR13","doi-asserted-by":"crossref","unstructured":"Funabiki, N., Takefuji, Y., Lee, K.C.: A neural network model for finding a near-maximum clique. J. Parallel Distrib. Comput. 14(3), 340\u2013344 (1992). doi: 10.1016\/0743-7315(92)90072-U","DOI":"10.1016\/0743-7315(92)90072-U"},{"key":"75_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer, Dordrecht (1997)"},{"issue":"6","key":"75_CR15","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/s10732-007-9055-x","volume":"14","author":"A Grosso","year":"2008","unstructured":"Grosso, A., Locatelli, M., Pullan, W.: Simple ingredients leading to very efficient heuristics for the maximum clique problem. J. Heuristics 14(6), 587\u2013612 (2008). doi: 10.1007\/s10732-007-9055-x","journal-title":"J. Heuristics"},{"issue":"7","key":"75_CR16","first-page":"537","volume":"40","author":"E Jenelius","year":"2006","unstructured":"Jenelius, E., Petersen, T., Mattsson, L.: Importance and exposure in road network vulnerability analysis. Transp. Res. Part A: Policy Pract. 40(7), 537\u2013560 (2006). doi: 10.1016\/j.tra.2005.11.003","journal-title":"Transp. Res. Part A: Policy Pract."},{"issue":"4","key":"75_CR17","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1002\/rsa.3240030402","volume":"3","author":"M Jerrum","year":"1992","unstructured":"Jerrum, M.: Large cliques elude the metropolis process. Random Struct. Algorithms 3(4), 347\u2013359 (1992). doi: 10.1002\/rsa.3240030402","journal-title":"Random Struct. Algorithms"},{"key":"75_CR18","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum, New York (1972)"},{"key":"75_CR19","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. MATCH Commun. Math. Comput. Chem. 58, 569\u2013590 (2007)","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"75_CR20","first-page":"167","volume":"12","author":"R Kopf","year":"1987","unstructured":"Kopf, R., Ruhe, G.: A computational study of the weighted independent set problem for general graphs. Found. Control Eng. 12, 167\u2013180 (1987)","journal-title":"Found. Control Eng."},{"key":"75_CR21","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 2010 22nd IEEE International Conference on Tools with Artificial Intelligence\u2014Volume 01 (ICTAI\u201910), pp 344\u2013351. IEEE, Arras, France (2010a)","DOI":"10.1109\/ICTAI.2010.57"},{"key":"75_CR22","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 Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI-10), pp. 128\u2013133. AAAI Press, Atlanta, USA (2010b)","DOI":"10.1609\/aaai.v24i1.7536"},{"key":"75_CR23","doi-asserted-by":"crossref","unstructured":"Marchiori, E.: Genetic, iterated and multistart local search for the maximum clique problem. In: Applications of Evolutionary Computing, Springer, LNCS, pp. 112\u2013121. Springer, Berlin (2002)","DOI":"10.1007\/3-540-46004-7_12"},{"key":"75_CR24","doi-asserted-by":"crossref","unstructured":"Matula, D.W., Marble, G., Isaacson, J.D.: Graph coloring algorithms. In: Read, R.C. (ed.) Graph Theory and Computing, pp 109\u2013122. Academic Press, New York (1972)","DOI":"10.1016\/B978-1-4832-3187-7.50015-5"},{"key":"75_CR25","doi-asserted-by":"crossref","first-page":"161","DOI":"10.4064\/cm-3-2-161-162","volume":"3","author":"J Mycielski","year":"1955","unstructured":"Mycielski, J.: Sur le coloriage des graphes. Colloq. Math. 3, 161\u2013162 (1955)","journal-title":"Colloq. Math."},{"issue":"1","key":"75_CR26","first-page":"159","volume":"25","author":"W Pullan","year":"2006","unstructured":"Pullan, W., Hoos, H.H.: Dynamic local search for the maximum clique problem. J. Artif. Int. Res. 25(1), 159\u2013185 (2006)","journal-title":"J. Artif. Int. Res."},{"issue":"1\u20132","key":"75_CR27","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10732-006-3750-x","volume":"12","author":"A Singh","year":"2006","unstructured":"Singh, A., Gupta, A.K.: A hybrid heuristic for the maximum clique problem. J. Heuristics 12(1\u20132), 5\u201322 (2006). doi: 10.1007\/s10732-006-3750-x","journal-title":"J. Heuristics"},{"issue":"11","key":"75_CR28","first-page":"11","volume":"18","author":"NJA Sloane","year":"1989","unstructured":"Sloane, N.J.A.: Unsolved problems in graph theory arising from the study of codes. Graph Theory Notes NY 18(11), 11\u201320 (1989)","journal-title":"Graph Theory Notes NY"},{"issue":"1","key":"75_CR29","doi-asserted-by":"crossref","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":"75_CR30","doi-asserted-by":"crossref","unstructured":"Tomita, E., Seki, T.: An efficient branch-and-bound algorithm for finding a maximum clique. In: Proceedings of the 4th International Conference on Discrete Mathematics and Theoretical Computer Science (DMTCS\u201903), pp. 278\u2013289. Springer, Berlin, Heidelberg (2003)","DOI":"10.1007\/3-540-45066-1_22"},{"key":"75_CR31","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: Proceedings of the 4th International Conference on Algorithms and Computation (WALCOM\u201910), pp. 191\u2013203. Springer, Berlin, Heidelberg (2010). doi:\u00a0 10.1007\/978-3-642-11440-3_18"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-013-0075-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-013-0075-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-013-0075-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T19:16:48Z","timestamp":1688239008000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-013-0075-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,16]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["75"],"URL":"https:\/\/doi.org\/10.1007\/s10898-013-0075-9","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,16]]}}}