{"id":"https://openalex.org/W7128786656","doi":"https://doi.org/10.1016/j.orl.2026.107425","title":"A note on the maximum clique LP relaxation","display_name":"A note on the maximum clique LP relaxation","publication_year":2026,"publication_date":"2026-02-13","ids":{"openalex":"https://openalex.org/W7128786656","doi":"https://doi.org/10.1016/j.orl.2026.107425"},"language":"en","primary_location":{"id":"doi:10.1016/j.orl.2026.107425","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.orl.2026.107425","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.orl.2026.107425","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5125946499","display_name":"Pavel Zakharov","orcid":null},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Pavel Zakharov","raw_affiliation_strings":["Department of Computer Science, TU Dortmund, Otto-Hahn-Str. 12, Dortmund, 44227, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, TU Dortmund, Otto-Hahn-Str. 12, Dortmund, 44227, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5125946499"],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":{"value":2760,"currency":"USD","value_usd":2760},"apc_paid":{"value":2760,"currency":"USD","value_usd":2760},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.38942634,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"66","issue":null,"first_page":"107425","last_page":"107425"},"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.7730000019073486,"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.7730000019073486,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.11670000106096268,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.036400001496076584,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.7712000012397766},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.7117000222206116},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.6643999814987183},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.6212000250816345},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.47929999232292175},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.4401000142097473},{"id":"https://openalex.org/keywords/clique-number","display_name":"Clique number","score":0.3702000081539154},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.36649999022483826}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7764000296592712},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7756999731063843},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.7712000012397766},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.7117000222206116},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6643999814987183},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.6212000250816345},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.47929999232292175},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.4401000142097473},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4194999933242798},{"id":"https://openalex.org/C2985491264","wikidata":"https://www.wikidata.org/wiki/Q761631","display_name":"Clique number","level":3,"score":0.3702000081539154},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.36649999022483826},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.3495999872684479},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.33149999380111694},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.3199999928474426},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.3160000145435333},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.2919999957084656},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2816999852657318},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.2605000138282776},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25450000166893005}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.orl.2026.107425","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.orl.2026.107425","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Letters","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.orl.2026.107425","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.orl.2026.107425","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Letters","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2081254453","https://openalex.org/W2086653003","https://openalex.org/W2150285483"],"related_works":[],"abstract_inverted_index":{"We":[0,23],"study":[1],"the":[2,8,18,41,46],"well-known":[3],"linear":[4],"programming":[5],"relaxation":[6,27],"of":[7,53],"maximum":[9],"clique":[10,20,43,48],"problem,":[11],"whose":[12],"optimal":[13],"value":[14],"is":[15],"known":[16],"as":[17],"fractional":[19,42],"number":[21,44,49],".":[22],"show":[24],"that":[25],"this":[26],"exhibits":[28],"a":[29,51],"large":[30],"integrality":[31],"gap:":[32],"there":[33],"exist":[34],"graphs":[35],"on":[36],"n":[37,55,58],"vertices":[38],"for":[39],"which":[40],"exceeds":[45],"actual":[47],"by":[50],"factor":[52],"\u0398(":[54],"/log":[56],"2":[57],").":[59]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2026-02-14T00:00:00"}