{"id":"https://openalex.org/W2013020979","doi":"https://doi.org/10.1007/s10898-013-0075-9","title":"Speeding up branch and bound algorithms for solving the maximum clique problem","display_name":"Speeding up branch and bound algorithms for solving the maximum clique problem","publication_year":2013,"publication_date":"2013-05-15","ids":{"openalex":"https://openalex.org/W2013020979","doi":"https://doi.org/10.1007/s10898-013-0075-9","mag":"2013020979"},"language":"en","primary_location":{"id":"doi:10.1007/s10898-013-0075-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10898-013-0075-9","pdf_url":null,"source":{"id":"https://openalex.org/S115925768","display_name":"Journal of Global Optimization","issn_l":"0925-5001","issn":["0925-5001","1573-2916"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Global Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041495997","display_name":"Evgeny Maslov","orcid":null},"institutions":[{"id":"https://openalex.org/I118501908","display_name":"National Research University Higher School of Economics","ror":"https://ror.org/055f7t516","country_code":"RU","type":"education","lineage":["https://openalex.org/I118501908"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Evgeny Maslov","raw_affiliation_strings":["Laboratory of Algorithms and Technologies for Networks Analysis, National Research University Higher School of Economics, 136 Rodionova Street, Niznhy Novgorod, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratory of Algorithms and Technologies for Networks Analysis, National Research University Higher School of Economics, 136 Rodionova Street, Niznhy Novgorod, Russia","institution_ids":["https://openalex.org/I118501908"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019206200","display_name":"Mikhail Batsyn","orcid":"https://orcid.org/0000-0002-0302-2673"},"institutions":[{"id":"https://openalex.org/I118501908","display_name":"National Research University Higher School of Economics","ror":"https://ror.org/055f7t516","country_code":"RU","type":"education","lineage":["https://openalex.org/I118501908"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Mikhail Batsyn","raw_affiliation_strings":["Laboratory of Algorithms and Technologies for Networks Analysis, National Research University Higher School of Economics, 136 Rodionova Street, Niznhy Novgorod, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratory of Algorithms and Technologies for Networks Analysis, National Research University Higher School of Economics, 136 Rodionova Street, Niznhy Novgorod, Russia","institution_ids":["https://openalex.org/I118501908"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050062467","display_name":"P\u00e3nos M. Pardalos","orcid":"https://orcid.org/0000-0001-9623-8053"},"institutions":[{"id":"https://openalex.org/I118501908","display_name":"National Research University Higher School of Economics","ror":"https://ror.org/055f7t516","country_code":"RU","type":"education","lineage":["https://openalex.org/I118501908"]},{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]},{"id":"https://openalex.org/I4210089412","display_name":"Applied Optimization (United States)","ror":"https://ror.org/004b0n253","country_code":"US","type":"company","lineage":["https://openalex.org/I4210089412"]}],"countries":["RU","US"],"is_corresponding":false,"raw_author_name":"Panos M. Pardalos","raw_affiliation_strings":["Center of Applied Optimization, University of Florida, 303 Weil Hall, Gainesville, FL, 32611, USA","Laboratory of Algorithms and Technologies for Networks Analysis, National Research University Higher School of Economics, 136 Rodionova Street, Niznhy Novgorod, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center of Applied Optimization, University of Florida, 303 Weil Hall, Gainesville, FL, 32611, USA","institution_ids":["https://openalex.org/I4210089412","https://openalex.org/I33213144"]},{"raw_affiliation_string":"Laboratory of Algorithms and Technologies for Networks Analysis, National Research University Higher School of Economics, 136 Rodionova Street, Niznhy Novgorod, Russia","institution_ids":["https://openalex.org/I118501908"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5019206200"],"corresponding_institution_ids":["https://openalex.org/I118501908"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2780},"apc_paid":null,"fwci":2.6072,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.89374505,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"59","issue":"1","first_page":"1","last_page":"21"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.8310216665267944},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.7022511959075928},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6841238737106323},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6688781380653381},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.6585800647735596},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6255370378494263},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6014972925186157},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5944836735725403},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5524939298629761},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.5399326086044312},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.47253942489624023},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36588120460510254},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35098016262054443},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24321073293685913},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.14340171217918396},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.10297566652297974},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.09801563620567322}],"concepts":[{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.8310216665267944},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.7022511959075928},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6841238737106323},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6688781380653381},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.6585800647735596},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6255370378494263},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6014972925186157},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5944836735725403},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5524939298629761},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.5399326086044312},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.47253942489624023},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36588120460510254},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35098016262054443},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24321073293685913},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.14340171217918396},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.10297566652297974},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.09801563620567322},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10898-013-0075-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10898-013-0075-9","pdf_url":null,"source":{"id":"https://openalex.org/S115925768","display_name":"Journal of Global Optimization","issn_l":"0925-5001","issn":["0925-5001","1573-2916"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Global Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jglopt:v:59:y:2014:i:1:p:1-21","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1007/s10898-013-0075-9","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W90158989","https://openalex.org/W149461665","https://openalex.org/W580669025","https://openalex.org/W1516453703","https://openalex.org/W1516636018","https://openalex.org/W1574847221","https://openalex.org/W1594785451","https://openalex.org/W1976659547","https://openalex.org/W1994203526","https://openalex.org/W2000182187","https://openalex.org/W2010601719","https://openalex.org/W2010828888","https://openalex.org/W2026320281","https://openalex.org/W2035372875","https://openalex.org/W2041588219","https://openalex.org/W2043005464","https://openalex.org/W2060792871","https://openalex.org/W2066356146","https://openalex.org/W2082603400","https://openalex.org/W2090275183","https://openalex.org/W2098667053","https://openalex.org/W2100505346","https://openalex.org/W2106586875","https://openalex.org/W2110504071","https://openalex.org/W2116007667","https://openalex.org/W2126517143","https://openalex.org/W2166742555","https://openalex.org/W2171103562","https://openalex.org/W2183091601","https://openalex.org/W2339500526","https://openalex.org/W2401610261","https://openalex.org/W2991337620","https://openalex.org/W2997776631","https://openalex.org/W4212899374","https://openalex.org/W4312935561"],"related_works":["https://openalex.org/W2165678151","https://openalex.org/W2084616826","https://openalex.org/W1983294952","https://openalex.org/W2009796757","https://openalex.org/W2568448495","https://openalex.org/W1796509207","https://openalex.org/W2008600006","https://openalex.org/W1972259521","https://openalex.org/W2082603400","https://openalex.org/W119756842"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}