{"id":"https://openalex.org/W2161099030","doi":"https://doi.org/10.1109/comsnets.2011.5716411","title":"Survivable network design using polyhedral approaches","display_name":"Survivable network design using polyhedral approaches","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2161099030","doi":"https://doi.org/10.1109/comsnets.2011.5716411","mag":"2161099030"},"language":"en","primary_location":{"id":"doi:10.1109/comsnets.2011.5716411","is_oa":false,"landing_page_url":"https://doi.org/10.1109/comsnets.2011.5716411","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","raw_type":"proceedings-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/A5071538660","display_name":"Yogesh K. Agarwal","orcid":"https://orcid.org/0000-0001-6189-0017"},"institutions":[{"id":"https://openalex.org/I91699865","display_name":"Indian Institute of Management Lucknow","ror":"https://ror.org/05gfjrx96","country_code":"IN","type":"education","lineage":["https://openalex.org/I91699865"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Y K Agarwal","raw_affiliation_strings":["Indian Institute of Management, Lucknow, India"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Management, Lucknow, India","institution_ids":["https://openalex.org/I91699865"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5071538660"],"corresponding_institution_ids":["https://openalex.org/I91699865"],"apc_list":null,"apc_paid":null,"fwci":0.7556,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.79136069,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"11","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9961000084877014,"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.9961000084877014,"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.98580002784729,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9836000204086304,"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/integer-programming","display_name":"Integer programming","score":0.6066836714744568},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5958474278450012},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5927420854568481},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5821976065635681},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5699622631072998},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.5356220006942749},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.5226325988769531},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4937797486782074},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4928717613220215},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.45917725563049316},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4589705169200897},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.44981932640075684},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4427395462989807},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.42702263593673706},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.4099128842353821},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2914440631866455},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19950836896896362},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1354350745677948},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11526656150817871}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6066836714744568},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5958474278450012},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5927420854568481},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5821976065635681},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5699622631072998},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.5356220006942749},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.5226325988769531},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4937797486782074},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4928717613220215},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.45917725563049316},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4589705169200897},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.44981932640075684},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4427395462989807},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.42702263593673706},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.4099128842353821},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2914440631866455},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19950836896896362},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1354350745677948},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11526656150817871},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/comsnets.2011.5716411","is_oa":false,"landing_page_url":"https://doi.org/10.1109/comsnets.2011.5716411","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4300000071525574,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1990033630","https://openalex.org/W2014814924","https://openalex.org/W2018214829","https://openalex.org/W2048591198","https://openalex.org/W2089534458","https://openalex.org/W2091109961","https://openalex.org/W2260210404","https://openalex.org/W4235096043","https://openalex.org/W4254784363","https://openalex.org/W4285719527","https://openalex.org/W6692690043"],"related_works":["https://openalex.org/W4231500168","https://openalex.org/W90079504","https://openalex.org/W2032436423","https://openalex.org/W3141113327","https://openalex.org/W3035974271","https://openalex.org/W1561045713","https://openalex.org/W2374451529","https://openalex.org/W2120679858","https://openalex.org/W1914605361","https://openalex.org/W2071199983"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,23,27,30,36,44,55,58,64,87,100,125],"problem":[3,68],"of":[4,12,32,38,60,103,111,131,157,173],"designing":[5],"a":[6,13,17,72,81,95,144],"survivable":[7],"telecommunication":[8],"network":[9,56],"using":[10,63],"facilities":[11,34],"fixed":[14],"capacity.":[15,66],"Given":[16],"graph":[18],"G":[19],"=":[20],"(V,":[21],"E),":[22],"traffic":[24,62],"demand":[25],"among":[26],"nodes,":[28],"and":[29,113,136,162],"cost":[31,46],"installing":[33],"on":[35,91,124,151],"edges":[37,138,164],"G,":[39],"we":[40,107,154],"wish":[41],"to":[42,118,133,159,165],"design":[43],"minimum":[45],"network,":[47],"so":[48],"that":[49,98,168],"under":[50],"any":[51],"single":[52],"edge":[53],"failure,":[54],"permits":[57],"flow":[59],"all":[61],"remaining":[65],"The":[67],"is":[69],"modeled":[70],"as":[71],"mixed":[73],"integer":[74,83,105],"program,":[75,106],"which":[76,116],"can":[77],"be":[78],"converted":[79],"into":[80],"pure":[82],"program":[84],"by":[85],"applying":[86],"well-known":[88],"Japanese":[89],"Theorem":[90],"multi-commodity":[92],"flows.":[93],"Using":[94,127,147],"key":[96],"theorem":[97],"characterizes":[99],"facet":[101],"inequalities":[102],"this":[104,152],"derive":[108],"several":[109],"families":[110],"3-":[112],"4-partition":[114],"facets,":[115],"help":[117],"achieve":[119],"extremely":[120],"tight":[121],"lower":[122],"bounds":[123],"problem.":[126],"these":[128],"bounds,":[129],"problems":[130,156],"up":[132,158],"20":[134],"nodes":[135,161],"40":[137,160],"have":[139],"been":[140],"solved":[141],"optimally":[142],"in":[143],"pervious":[145],"work.":[146],"heuristic":[148],"approaches":[149],"based":[150],"framework,":[153],"solve":[155],"80":[163],"obtain":[166],"solutions":[167],"are":[169],"approximately":[170],"within":[171],"5%":[172],"optimal":[174],"solutions.":[175]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}