{"id":"https://openalex.org/W4417527294","doi":"https://doi.org/10.1002/net.70020","title":"Compact Mixed Integer Programming Formulations for the Minimum Biclique Cover Problem","display_name":"Compact Mixed Integer Programming Formulations for the Minimum Biclique Cover Problem","publication_year":2025,"publication_date":"2025-12-20","ids":{"openalex":"https://openalex.org/W4417527294","doi":"https://doi.org/10.1002/net.70020"},"language":"en","primary_location":{"id":"doi:10.1002/net.70020","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.70020","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5120868246","display_name":"Bruno Burin","orcid":null},"institutions":[{"id":"https://openalex.org/I41870","display_name":"Military Institute of Engineering","ror":"https://ror.org/03veakt65","country_code":"BR","type":"education","lineage":["https://openalex.org/I41870"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Bruno Burin","raw_affiliation_strings":["Computer Engineering Department Military Institute of Engineering  Rio de Janeiro Brazil","Computer Engineering Department, Military Institute of Engineering, Rio de Janeiro, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Engineering Department Military Institute of Engineering  Rio de Janeiro Brazil","institution_ids":["https://openalex.org/I41870"]},{"raw_affiliation_string":"Computer Engineering Department, Military Institute of Engineering, Rio de Janeiro, Brazil","institution_ids":["https://openalex.org/I41870"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040558644","display_name":"Hamidreza Validi","orcid":"https://orcid.org/0000-0002-7983-7262"},"institutions":[{"id":"https://openalex.org/I12315562","display_name":"Texas Tech University","ror":"https://ror.org/0405mnx93","country_code":"US","type":"education","lineage":["https://openalex.org/I12315562"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hamidreza Validi","raw_affiliation_strings":["Industrial, Manufacturing and Systems Engineering Texas Tech University  Lubbock Texas USA","Industrial, Manufacturing and Systems Engineering, Texas Tech University, Lubbock, Texas, USA"],"raw_orcid":"https://orcid.org/0000-0002-7983-7262","affiliations":[{"raw_affiliation_string":"Industrial, Manufacturing and Systems Engineering Texas Tech University  Lubbock Texas USA","institution_ids":["https://openalex.org/I12315562"]},{"raw_affiliation_string":"Industrial, Manufacturing and Systems Engineering, Texas Tech University, Lubbock, Texas, USA","institution_ids":["https://openalex.org/I12315562"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109430108","display_name":"Bochuan Lyu","orcid":null},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bochuan Lyu","raw_affiliation_strings":["Computational Applied Mathematics and Operations Research Rice University  Houston Texas USA","Computational Applied Mathematics and Operations Research, Rice University, Houston, Texas, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computational Applied Mathematics and Operations Research Rice University  Houston Texas USA","institution_ids":["https://openalex.org/I74775410"]},{"raw_affiliation_string":"Computational Applied Mathematics and Operations Research, Rice University, Houston, Texas, USA","institution_ids":["https://openalex.org/I74775410"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025235914","display_name":"Illya V. Hicks","orcid":"https://orcid.org/0000-0002-7815-796X"},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Illya V. Hicks","raw_affiliation_strings":["Computational Applied Mathematics and Operations Research Rice University  Houston Texas USA","Computational Applied Mathematics and Operations Research, Rice University, Houston, Texas, USA"],"raw_orcid":"https://orcid.org/0000-0002-7815-796X","affiliations":[{"raw_affiliation_string":"Computational Applied Mathematics and Operations Research Rice University  Houston Texas USA","institution_ids":["https://openalex.org/I74775410"]},{"raw_affiliation_string":"Computational Applied Mathematics and Operations Research, Rice University, Houston, Texas, USA","institution_ids":["https://openalex.org/I74775410"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5040558644"],"corresponding_institution_ids":["https://openalex.org/I12315562"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.50145641,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"87","issue":"3","first_page":"257","last_page":"265"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.6622999906539917,"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.6622999906539917,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.16410000622272491,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.07020000368356705,"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/bipartite-graph","display_name":"Bipartite graph","score":0.7193999886512756},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.6861000061035156},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6402000188827515},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.6331999897956848},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.5472000241279602},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5034000277519226},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.4973999857902527},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.429500013589859},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4253000020980835},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.420199990272522}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7534999847412109},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7193999886512756},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.6861000061035156},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6402000188827515},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.6331999897956848},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5960000157356262},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.5472000241279602},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5034000277519226},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.4973999857902527},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48660001158714294},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.429500013589859},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4253000020980835},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.420199990272522},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.3758000135421753},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.373199999332428},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3652999997138977},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33329999446868896},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.33219999074935913},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.32170000672340393},{"id":"https://openalex.org/C9767117","wikidata":"https://www.wikidata.org/wiki/Q12510","display_name":"Torus","level":2,"score":0.31279999017715454},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.31049999594688416},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3093999922275543},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3050999939441681},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.3034999966621399},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.29660001397132874},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.2962999939918518},{"id":"https://openalex.org/C134516590","wikidata":"https://www.wikidata.org/wiki/Q475603","display_name":"Set packing","level":3,"score":0.2955999970436096},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.29440000653266907},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.29190000891685486},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.28189998865127563},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.2619999945163727},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2540000081062317},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2515000104904175},{"id":"https://openalex.org/C63548660","wikidata":"https://www.wikidata.org/wiki/Q858223","display_name":"Limit point","level":2,"score":0.25040000677108765}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.70020","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.70020","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3431120644","display_name":null,"funder_award_id":"DMS\u20102318790","funder_id":"https://openalex.org/F4320335353","funder_display_name":"National Science Foundation of Sri Lanka"}],"funders":[{"id":"https://openalex.org/F4320335353","display_name":"National Science Foundation of Sri Lanka","ror":"https://ror.org/010xaa060"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1601764037","https://openalex.org/W1994836458","https://openalex.org/W1997890669","https://openalex.org/W2014178973","https://openalex.org/W2040570634","https://openalex.org/W2041446334","https://openalex.org/W2065163038","https://openalex.org/W2116453796","https://openalex.org/W2147972841","https://openalex.org/W2152486369","https://openalex.org/W2963059144","https://openalex.org/W3103809129","https://openalex.org/W4232896595","https://openalex.org/W4256558977","https://openalex.org/W4367050080"],"related_works":[],"abstract_inverted_index":{"ABSTRACT":[0],"Given":[1],"a":[2,26,97,137],"simple":[3],"graph":[4,24],"with":[5,25,106],"vertex":[6,72],"set":[7,10,108],"and":[8,63,71,81,117,144],"edge":[9,61,70],",":[11,86],"the":[12,23,47,60,69,75,142,154,161],"minimum":[13,27,48],"biclique":[14,49],"cover":[15,19,50],"problem":[16,51],"seeks":[17],"to":[18,134,160],"all":[20],"edges":[21],"of":[22,29,79,100,109,125],"number":[28,99],"bicliques":[30],"(i.e.,":[31],"complete":[32],"bipartite":[33],"subgraphs).":[34],"This":[35],"paper":[36],"proposes":[37],"two":[38],"compact":[39],"mixed":[40],"integer":[41],"programming":[42],"(MIP)":[43],"formulations":[44],"for":[45],"solving":[46],"on":[52],"general":[53],"graphs:":[54],"(i)":[55],"A":[56],"natural":[57,76,93],"formulation":[58,67,78,94],"in":[59,68,136,153],"space":[62],"(ii)":[64],"an":[65],"extended":[66],"spaces.":[73],"While":[74],"MIP":[77],"Cornaz":[80],"Fonlupt":[82],"(":[83],"Discrete":[84],"Mathematics":[85],"2006)":[87],"has":[88],"exponentially":[89],"many":[90],"constraints,":[91],"our":[92,126],"enjoys":[95],"only":[96],"polynomial":[98,110],"their":[101],"exponential":[102],"\u201cno\u2010good\u201d":[103],"cuts,":[104],"along":[105],"another":[107],"valid":[111],"inequalities.":[112],"We":[113],"also":[114],"employ":[115],"bounding":[116,143],"variable":[118],"fixing":[119,145],"procedures":[120],"that":[121,149],"help":[122],"solve":[123],"most":[124],"social":[127],"network":[128],"instances,":[129],"which":[130],"are":[131,150,158],"not":[132,151],"solvable":[133],"optimality":[135],"one\u2010hour":[138,155],"time":[139,156],"limit":[140,157],"without":[141],"procedures.":[146],"The":[147],"instances":[148],"solved":[152],"submitted":[159],"2024":[162],"Mixed":[163],"Integer":[164],"Programming":[165],"Library":[166],"(MIPLIB":[167],"2024).":[168]},"counts_by_year":[],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2025-12-20T00:00:00"}