{"id":"https://openalex.org/W7153494404","doi":"https://doi.org/10.1111/itor.70184","title":"Ensuring connectedness for the maximum quasi\u2010clique and densest <i>k</i> \u2010subgraph problems","display_name":"Ensuring connectedness for the maximum quasi\u2010clique and densest <i>k</i> \u2010subgraph problems","publication_year":2026,"publication_date":"2026-04-11","ids":{"openalex":"https://openalex.org/W7153494404","doi":"https://doi.org/10.1111/itor.70184"},"language":"en","primary_location":{"id":"doi:10.1111/itor.70184","is_oa":true,"landing_page_url":"https://doi.org/10.1111/itor.70184","pdf_url":null,"source":{"id":"https://openalex.org/S267729","display_name":"International Transactions in Operational Research","issn_l":"0969-6016","issn":["0969-6016","1475-3995"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Transactions in Operational Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1111/itor.70184","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5123051703","display_name":"Daniela Scherer dos Santos","orcid":null},"institutions":[{"id":"https://openalex.org/I76903346","display_name":"University of Coimbra","ror":"https://ror.org/04z8k9a98","country_code":"PT","type":"education","lineage":["https://openalex.org/I76903346"]}],"countries":["PT"],"is_corresponding":true,"raw_author_name":"Daniela Scherer dos Santos","raw_affiliation_strings":["University of Coimbra, CISUC/LASI, DEI Coimbra Portugal"],"raw_orcid":"https://orcid.org/0000-0003-1034-0589","affiliations":[{"raw_affiliation_string":"University of Coimbra, CISUC/LASI, DEI Coimbra Portugal","institution_ids":["https://openalex.org/I76903346"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056075291","display_name":"Kathrin Klamroth","orcid":"https://orcid.org/0000-0001-9119-0732"},"institutions":[{"id":"https://openalex.org/I167360494","display_name":"University of Wuppertal","ror":"https://ror.org/00613ak93","country_code":"DE","type":"education","lineage":["https://openalex.org/I167360494"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Kathrin Klamroth","raw_affiliation_strings":["School of Mathematics and Natural Sciences University of Wuppertal Wuppertal Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics and Natural Sciences University of Wuppertal Wuppertal Germany","institution_ids":["https://openalex.org/I167360494"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029933141","display_name":"Pedro Martins","orcid":"https://orcid.org/0000-0001-9600-082X"},"institutions":[{"id":"https://openalex.org/I141596103","display_name":"University of Lisbon","ror":"https://ror.org/01c27hj86","country_code":"PT","type":"education","lineage":["https://openalex.org/I141596103"]},{"id":"https://openalex.org/I293362453","display_name":"Polytechnic Institute of Coimbra","ror":"https://ror.org/01n8x4993","country_code":"PT","type":"education","lineage":["https://openalex.org/I293362453"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Pedro Martins","raw_affiliation_strings":["Center for Mathematical Studies \u2010 CEMS.UL Lisbon Portugal","Coimbra Business School \u2010 ISCAC Polytechnic Institute of Coimbra Coimbra Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Mathematical Studies \u2010 CEMS.UL Lisbon Portugal","institution_ids":["https://openalex.org/I141596103"]},{"raw_affiliation_string":"Coimbra Business School \u2010 ISCAC Polytechnic Institute of Coimbra Coimbra Portugal","institution_ids":["https://openalex.org/I293362453"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055996291","display_name":"Lu\u00eds Paquete","orcid":"https://orcid.org/0000-0001-7525-8901"},"institutions":[{"id":"https://openalex.org/I76903346","display_name":"University of Coimbra","ror":"https://ror.org/04z8k9a98","country_code":"PT","type":"education","lineage":["https://openalex.org/I76903346"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Lu\u00eds Paquete","raw_affiliation_strings":["University of Coimbra, CISUC/LASI, DEI Coimbra Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Coimbra, CISUC/LASI, DEI Coimbra Portugal","institution_ids":["https://openalex.org/I76903346"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5123051703"],"corresponding_institution_ids":["https://openalex.org/I76903346"],"apc_list":{"value":3660,"currency":"USD","value_usd":3660},"apc_paid":{"value":3660,"currency":"USD","value_usd":3660},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.38651197,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"33","issue":"6","first_page":"3800","last_page":"3824"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.5047000050544739,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.5047000050544739,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.2565000057220459,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.05640000104904175,"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/social-connectedness","display_name":"Social connectedness","score":0.892300009727478},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5663999915122986},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5422999858856201},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.508899986743927},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48489999771118164},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4239000082015991}],"concepts":[{"id":"https://openalex.org/C201943243","wikidata":"https://www.wikidata.org/wiki/Q7551008","display_name":"Social connectedness","level":2,"score":0.892300009727478},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6248999834060669},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6157000064849854},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5663999915122986},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5422999858856201},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.508899986743927},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48489999771118164},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4239000082015991},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.39989998936653137},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.352400004863739},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3521000146865845},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.32010000944137573},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2833999991416931},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2750999927520752},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.27129998803138733},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.2662000060081482}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1111/itor.70184","is_oa":true,"landing_page_url":"https://doi.org/10.1111/itor.70184","pdf_url":null,"source":{"id":"https://openalex.org/S267729","display_name":"International Transactions in Operational Research","issn_l":"0969-6016","issn":["0969-6016","1475-3995"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Transactions in Operational Research","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1111/itor.70184","is_oa":true,"landing_page_url":"https://doi.org/10.1111/itor.70184","pdf_url":null,"source":{"id":"https://openalex.org/S267729","display_name":"International Transactions in Operational Research","issn_l":"0969-6016","issn":["0969-6016","1475-3995"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Transactions in Operational Research","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3218901447","display_name":"Algorithms for the maximum quasi-clique problem and variants.","funder_award_id":"2022.12082.BD","funder_id":"https://openalex.org/F4320334779","funder_display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia"},{"id":"https://openalex.org/G3926489203","display_name":"CENTRE FOR INFORMATICS AND SYSTEMS OF THE UNIVERSITY OF COIMBRA","funder_award_id":"UID/00326/2025","funder_id":"https://openalex.org/F4320334779","funder_display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia"},{"id":"https://openalex.org/G3936589471","display_name":"Center for Mathematical Studies at Ci\u00eancias ULisboa","funder_award_id":"UID/04561/2025","funder_id":"https://openalex.org/F4320334779","funder_display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia"}],"funders":[{"id":"https://openalex.org/F4320320366","display_name":"European Cooperation in Science and Technology","ror":"https://ror.org/01bstzn19"},{"id":"https://openalex.org/F4320334779","display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","ror":"https://ror.org/00snfqn58"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W13877772","https://openalex.org/W106934005","https://openalex.org/W136898455","https://openalex.org/W798612896","https://openalex.org/W1520195889","https://openalex.org/W1526632206","https://openalex.org/W1563728026","https://openalex.org/W1571644423","https://openalex.org/W1586552957","https://openalex.org/W1739450634","https://openalex.org/W1970964752","https://openalex.org/W2006278018","https://openalex.org/W2016153078","https://openalex.org/W2017127755","https://openalex.org/W2021294212","https://openalex.org/W2030365814","https://openalex.org/W2032279394","https://openalex.org/W2035080386","https://openalex.org/W2036836182","https://openalex.org/W2038396396","https://openalex.org/W2049287714","https://openalex.org/W2083376348","https://openalex.org/W2113308846","https://openalex.org/W2127048411","https://openalex.org/W2153952206","https://openalex.org/W2268749775","https://openalex.org/W2288870393","https://openalex.org/W2294347342","https://openalex.org/W2408452789","https://openalex.org/W2735921087","https://openalex.org/W2805404656","https://openalex.org/W2911851374","https://openalex.org/W2940838630","https://openalex.org/W2995720360","https://openalex.org/W2999572838","https://openalex.org/W3010204606","https://openalex.org/W3012447874","https://openalex.org/W3110851897","https://openalex.org/W3181343864","https://openalex.org/W4405662454"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Given":[1],"an":[2,88],"undirected":[3],"graph":[4],",":[5],"a":[6,9,32,50],"quasi\u2010clique":[7,27,33,130],"is":[8],"subgraph":[10,48],"of":[11,49,65,116,122],"with":[12,34,110],"density":[13],"at":[14],"least":[15],".":[16],"Two":[17],"optimisation":[18],"problems":[19,60],"can":[20],"be":[21,73],"defined":[22],"for":[23,75,92,101,143],"quasi\u2010cliques:":[24],"the":[25,39,46,63],"maximum":[26,35],"(MQC)":[28],"problem,":[29,43],"which":[30,44],"finds":[31,45],"vertex":[36],"cardinality,":[37],"and":[38,87,103,120],"densest":[40,47],"\u2010subgraph":[41],"(DKS)":[42],"given":[51],"fixed":[52],"cardinality.":[53],"Most":[54],"existing":[55,95,126],"approaches":[56,127],"to":[57,68],"solving":[58],"both":[59,117],"often":[61],"disregard":[62],"requirement":[64],"connectedness,":[66],"leading":[67],"unconnected":[69],"solutions":[70],"that":[71,128,135],"may":[72],"meaningless":[74],"many":[76],"real\u2010life":[77],"applications.":[78],"To":[79],"address":[80],"this":[81],"issue,":[82],"we":[83],"propose":[84],"two":[85],"flow\u2010based":[86],"Miller\u2013Tucher\u2013Zemlin\u2010based":[89],"connectedness":[90,112],"constraint":[91],"integration":[93],"into":[94],"mixed\u2010integer":[96],"linear":[97],"programming":[98],"(MILP)":[99],"formulations":[100,108],"MQC":[102],"DKS.":[104],"We":[105],"compare":[106],"MILP":[107],"enhanced":[109],"our":[111,136],"constraints":[113,137],"in":[114],"terms":[115],"running":[118],"time":[119],"number":[121],"solved":[123],"instances":[124],"against":[125],"ensure":[129],"connectedness.":[131,147],"Experimental":[132],"results":[133],"demonstrate":[134],"are":[138],"competitive,":[139],"making":[140],"them":[141],"valuable":[142],"practical":[144],"applications":[145],"requiring":[146]},"counts_by_year":[],"updated_date":"2026-06-09T06:18:44.609144","created_date":"2026-04-12T00:00:00"}