{"id":"https://openalex.org/W2533755512","doi":"https://doi.org/10.1109/codit.2016.7593645","title":"The multi-terminal vertex separator problem: Extended formulations and Branch-and-Cut-and-Price","display_name":"The multi-terminal vertex separator problem: Extended formulations and Branch-and-Cut-and-Price","publication_year":2016,"publication_date":"2016-04-01","ids":{"openalex":"https://openalex.org/W2533755512","doi":"https://doi.org/10.1109/codit.2016.7593645","mag":"2533755512"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2016.7593645","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5042572418","display_name":"Youcef Magnouche","orcid":"https://orcid.org/0009-0006-3778-703X"},"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":"Youcef Magnouche","raw_affiliation_strings":["Lamsade, Universit\u00e9 Paris Dauphin, Paris, France"],"affiliations":[{"raw_affiliation_string":"Lamsade, Universit\u00e9 Paris Dauphin, Paris, France","institution_ids":["https://openalex.org/I56435720"]}]},{"author_position":"middle","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 Dauphin, Paris, France"],"affiliations":[{"raw_affiliation_string":"Lamsade, Universit\u00e9 Paris Dauphin, Paris, France","institution_ids":["https://openalex.org/I56435720"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083892488","display_name":"S\u00e9bastien Martin","orcid":"https://orcid.org/0000-0002-8528-6698"},"institutions":[{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Sebastien Martin","raw_affiliation_strings":["LCOMS, Universit\u00e9 de Lorraine, Metz Metz, France"],"affiliations":[{"raw_affiliation_string":"LCOMS, Universit\u00e9 de Lorraine, Metz Metz, France","institution_ids":["https://openalex.org/I90183372"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.442,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":2,"citation_normalized_percentile":{"value":0.39597,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":73,"max":77},"biblio":{"volume":null,"issue":null,"first_page":"683","last_page":"688"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995,"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.9966,"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":[],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7275883},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6649832},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40026852},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39936137},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37575546},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.351355},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2601831}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2016.7593645","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":10,"referenced_works":["https://openalex.org/W1523006294","https://openalex.org/W192578035","https://openalex.org/W1967802975","https://openalex.org/W1991579759","https://openalex.org/W2013281124","https://openalex.org/W2015635922","https://openalex.org/W2033863375","https://openalex.org/W2319673916","https://openalex.org/W2912091052","https://openalex.org/W2988480584"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W3111310291","https://openalex.org/W3002753104","https://openalex.org/W2142036596","https://openalex.org/W2077600819","https://openalex.org/W2072657027","https://openalex.org/W2061531152","https://openalex.org/W2051487156","https://openalex.org/W2007980826","https://openalex.org/W1979597421"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"discuss":[4],"a":[5,13,33,42,100,126],"variant":[6],"of":[7,28,35,44,75],"the":[8,26,46,73,114,121,130],"well-known":[9],"k-separator":[10],"problem.":[11,115],"Given":[12],"simple":[14],"graph":[15],"G":[16],"=":[17],"(V":[18],"\u222a":[19,24],"T,":[20],"E)":[21],"with":[22],"V":[23,54,60,66,81,93,103],"T":[25,31],"set":[27,34,43],"vertices,":[29],"where":[30],"is":[32,77,97],"distinguished":[36],"vertices":[37],"called":[38],"terminals,":[39],"and":[40,89,125],"E":[41],"edges,":[45],"multi-terminal":[47],"vertex":[48,91,101],"separator":[49],"problem":[50],"consists":[51],"in":[52,92,102],"partitioning":[53],"\u222aT":[55],"into":[56],"k+1":[57],"subsets":[58],"{S,":[59],"1":[63],",":[64],"...,":[65],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">k":[69],"}":[70],"such":[71],"that":[72],"size":[74],"S":[76],"minimum,":[78],"each":[79],"subset":[80],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">i":[84,96],"contains":[85],"exactly":[86],"one":[87],"terminal":[88],"no":[90],"adjacent":[98],"to":[99],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">j":[106],".":[107],"Three":[108],"extended":[109],"formulations":[110,124],"are":[111,136],"proposed":[112],"for":[113,120,129],"We":[116],"develop":[117],"Branch-and-Price":[118],"algorithms":[119],"two":[122],"first":[123],"Branch-and-Cut-and-Price":[127],"algorithm":[128],"third":[131],"one.":[132],"Some":[133],"experimental":[134],"results":[135],"also":[137],"discussed.":[138]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2533755512","counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2024-12-27T07:46:58.505562","created_date":"2016-10-28"}