{"id":"https://openalex.org/W2404520152","doi":"https://doi.org/10.1109/drcn.2016.7470828","title":"The k-node-connected subgraph problem: Facets and Branch-and-Cut","display_name":"The k-node-connected subgraph problem: Facets and Branch-and-Cut","publication_year":2016,"publication_date":"2016-03-01","ids":{"openalex":"https://openalex.org/W2404520152","doi":"https://doi.org/10.1109/drcn.2016.7470828","mag":"2404520152"},"language":"en","primary_location":{"id":"doi:10.1109/drcn.2016.7470828","is_oa":false,"landing_page_url":"https://doi.org/10.1109/drcn.2016.7470828","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 12th International Conference on the Design of Reliable Communication Networks (DRCN)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5026008434","display_name":"Ibrahima Diarrassouba","orcid":"https://orcid.org/0000-0002-1924-0616"},"institutions":[{"id":"https://openalex.org/I141576021","display_name":"Universit\u00e9 Le Havre Normandie","ror":"https://ror.org/05v509s40","country_code":"FR","type":"education","lineage":["https://openalex.org/I141576021","https://openalex.org/I4210105918"]},{"id":"https://openalex.org/I4392021130","display_name":"Laboratoire de Math\u00e9matiques Appliqu\u00e9es du Havre","ror":"https://ror.org/017vnhv07","country_code":"FR","type":"facility","lineage":["https://openalex.org/I141576021","https://openalex.org/I4210105918","https://openalex.org/I4392021130"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Ibrahima Diarrassouba","raw_affiliation_strings":["LMAH Universit\u00e9 du Havre, Le Havre, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LMAH Universit\u00e9 du Havre, Le Havre, France","institution_ids":["https://openalex.org/I141576021","https://openalex.org/I4392021130"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062903419","display_name":"Meriem Mahjoub","orcid":"https://orcid.org/0000-0001-9263-6863"},"institutions":[{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Meriem Mahjoub","raw_affiliation_strings":["LAMSADE Universit\u00e9 Paris Dauphine, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LAMSADE Universit\u00e9 Paris Dauphine, Paris, France","institution_ids":["https://openalex.org/I56435720"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101855070","display_name":"A. Ridha Mahjoub","orcid":"https://orcid.org/0000-0002-1079-1892"},"institutions":[{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"A. Ridha Mahjoub","raw_affiliation_strings":["LAMSADE Universit\u00e9 Paris Dauphine, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LAMSADE Universit\u00e9 Paris Dauphine, Paris, France","institution_ids":["https://openalex.org/I56435720"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05156743,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"5","issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9970999956130981,"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.9970999956130981,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9959999918937683,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9940999746322632,"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/polytope","display_name":"Polytope","score":0.7303923964500427},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.7097585201263428},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6954348087310791},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6650239825248718},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.604841411113739},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.590856671333313},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5538364052772522},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.503330647945404},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.4600219130516052},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.41215071082115173},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.37712863087654114},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35550040006637573},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35537806153297424},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32459115982055664},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3155536651611328},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.18935853242874146},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.0763712227344513},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.06568741798400879}],"concepts":[{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.7303923964500427},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.7097585201263428},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6954348087310791},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6650239825248718},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.604841411113739},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.590856671333313},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5538364052772522},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.503330647945404},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.4600219130516052},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.41215071082115173},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37712863087654114},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35550040006637573},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35537806153297424},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32459115982055664},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3155536651611328},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.18935853242874146},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0763712227344513},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.06568741798400879},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/drcn.2016.7470828","is_oa":false,"landing_page_url":"https://doi.org/10.1109/drcn.2016.7470828","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 12th International Conference on the Design of Reliable Communication Networks (DRCN)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.5699999928474426,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1971023354","https://openalex.org/W1971846459","https://openalex.org/W1990666137","https://openalex.org/W2011039300","https://openalex.org/W2017538563","https://openalex.org/W2030292445","https://openalex.org/W2032889054","https://openalex.org/W2034321185","https://openalex.org/W2046469316","https://openalex.org/W2051818998","https://openalex.org/W2089135840","https://openalex.org/W2089731376","https://openalex.org/W2091402313","https://openalex.org/W2123324452","https://openalex.org/W2148237104","https://openalex.org/W2284291999","https://openalex.org/W4211176206","https://openalex.org/W4236709137"],"related_works":["https://openalex.org/W2769220156","https://openalex.org/W3006617646","https://openalex.org/W2009796757","https://openalex.org/W4210880521","https://openalex.org/W2046300504","https://openalex.org/W2263874601","https://openalex.org/W2734758384","https://openalex.org/W1593376002","https://openalex.org/W104270770","https://openalex.org/W1968202374"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,52],"consider":[4],"the":[5,17,21],"k-node-connected":[6],"subgraph":[7],"problem.":[8],"We":[9,24,36],"propose":[10],"an":[11],"integer":[12],"linear":[13],"programming":[14],"formulation":[15],"for":[16],"problem":[18],"and":[19,31,41,46],"investigate":[20],"associated":[22],"polytope.":[23],"introduce":[25],"further":[26],"classes":[27],"of":[28],"valid":[29],"inequalities":[30],"discuss":[32,42],"their":[33],"facial":[34],"aspect.":[35],"also":[37],"devise":[38,53],"separation":[39],"routines":[40],"some":[43,59],"structure":[44],"properties":[45],"reduction":[47],"operations.":[48],"Using":[49],"these":[50],"results,":[51],"a":[54],"Branch-and-Cut":[55],"algorithm":[56],"along":[57],"with":[58],"computational":[60],"results.":[61]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}