{"id":"https://openalex.org/W2476304293","doi":"https://doi.org/10.1109/hpsr.2016.7525631","title":"New challenges in network optimization","display_name":"New challenges in network optimization","publication_year":2016,"publication_date":"2016-06-01","ids":{"openalex":"https://openalex.org/W2476304293","doi":"https://doi.org/10.1109/hpsr.2016.7525631","mag":"2476304293"},"language":"en","primary_location":{"id":"doi:10.1109/hpsr.2016.7525631","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpsr.2016.7525631","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR)","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/A5075262684","display_name":"Dimitri B. Papadimitriou","orcid":"https://orcid.org/0000-0002-7677-9271"},"institutions":[{"id":"https://openalex.org/I4210160875","display_name":"Nokia (Belgium)","ror":"https://ror.org/04xze1462","country_code":"BE","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I4210160875"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Dimitri Papadimitriou","raw_affiliation_strings":["Nokia Bell Labs, Antwerp, Belgium"],"affiliations":[{"raw_affiliation_string":"Nokia Bell Labs, Antwerp, Belgium","institution_ids":["https://openalex.org/I4210160875"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5075262684"],"corresponding_institution_ids":["https://openalex.org/I4210160875"],"apc_list":null,"apc_paid":null,"fwci":0.8357,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.78091398,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"55","issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998000264167786,"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.9998000264167786,"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.9988999962806702,"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/T12288","display_name":"Optimization and Search Problems","score":0.9944000244140625,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7969977855682373},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5884517431259155},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.5284592509269714},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5155396461486816},{"id":"https://openalex.org/keywords/robust-optimization","display_name":"Robust optimization","score":0.5030054450035095},{"id":"https://openalex.org/keywords/provisioning","display_name":"Provisioning","score":0.4965212941169739},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.48840588331222534},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4753651022911072},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.44204437732696533},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3679822087287903},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.26684898138046265}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7969977855682373},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5884517431259155},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.5284592509269714},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5155396461486816},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.5030054450035095},{"id":"https://openalex.org/C172191483","wikidata":"https://www.wikidata.org/wiki/Q1071806","display_name":"Provisioning","level":2,"score":0.4965212941169739},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.48840588331222534},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4753651022911072},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.44204437732696533},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3679822087287903},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.26684898138046265},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.0},{"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/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpsr.2016.7525631","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpsr.2016.7525631","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W427310648","https://openalex.org/W1504916868","https://openalex.org/W1985672665","https://openalex.org/W1995285162","https://openalex.org/W2003777645","https://openalex.org/W2005893696","https://openalex.org/W2015646948","https://openalex.org/W2039333724","https://openalex.org/W2059732327","https://openalex.org/W2070802579","https://openalex.org/W2071439977","https://openalex.org/W2079003301","https://openalex.org/W2081956611","https://openalex.org/W2118578357","https://openalex.org/W2131116400","https://openalex.org/W2134798735","https://openalex.org/W2155526624","https://openalex.org/W2165775468","https://openalex.org/W2401238392","https://openalex.org/W2405756285","https://openalex.org/W2585300288","https://openalex.org/W2613070411","https://openalex.org/W3103583878","https://openalex.org/W6615000369","https://openalex.org/W6712573861"],"related_works":["https://openalex.org/W2065369945","https://openalex.org/W3149055374","https://openalex.org/W2053131036","https://openalex.org/W2216231335","https://openalex.org/W3195104199","https://openalex.org/W2146235116","https://openalex.org/W4386254288","https://openalex.org/W2951483638","https://openalex.org/W4292572523","https://openalex.org/W2809352861"],"abstract_inverted_index":{"This":[0,30],"document":[1],"provides":[2,119],"a":[3,139],"detailed":[4],"description":[5],"of":[6,38,68,75,105,124,153,181,192,240],"the":[7,17,35,66,103,111,114,122,150,169,179,182,230,241],"tutorial":[8],"lecture":[9,31,236],"on":[10,23,229],"Challenges":[11],"in":[12,46,196,220,245],"Network":[13],"Optimization":[14],"provided":[15],"at":[16,248],"2016":[18],"IEEE":[19],"17th":[20],"International":[21],"Conference":[22],"High":[24],"Performance":[25],"Switching":[26],"and":[27,70,73,92,100,222,251],"Routing":[28],"(HPSR).":[29],"is":[32],"motivated":[33],"by":[34,167,190,237],"recent":[36],"evolutions":[37],"communication":[39],"networks":[40],"which":[41],"have":[42],"induced":[43],"new":[44],"challenges":[45,244],"mixed-integer":[47,136],"network":[48,76,85,107,154,246],"optimization":[49,82,86,108,214,247],"ranging":[50],"from":[51],"problem":[52,116],"formulation":[53],"to":[54,79,172,198,207,216],"computational":[55,252],"methods.":[56],"Indeed,":[57,212],"paradigms":[58],"such":[59,160],"as":[60,138,161],"information-oriented":[61],"networks,":[62],"resource":[63,90],"abstraction":[64],"(at":[65],"heart":[67],"virtualization":[69],"other":[71,93],"cloudification),":[72],"programmability":[74],"functions":[77],"lead":[78],"combine":[80],"well-established":[81],"problems":[83,87,109,171],"with":[84,110,157,200],"(network":[88],"design,":[89],"placement/allocation":[91],"multi-commodity":[94],"flow":[95],"problems).":[96],"Beyond":[97],"dimensioning,":[98],"provisioning/configuring":[99],"scheduling/":[101],"planning,":[102],"combination":[104],"conventional":[106],"facility-location":[112],"or":[113],"hub-location":[115],"for":[117,121,141,149,225],"instance,":[118],"guidelines":[120],"design":[123,144],"unified":[125],"processes":[126],"that":[127],"address":[128],"these":[129,205],"evolutions.":[130],"In":[131],"this":[132,193,235],"tutorial,":[133],"we":[134,203],"exploit":[135],"programming":[137],"tool":[140],"driving":[142],"early":[143],"decisions":[145],"(thus,":[146],"not":[147],"only":[148],"traditional":[151],"application":[152],"optimization)":[155],"together":[156],"associated":[158,223],"requirements":[159],"congestion":[162],"awareness":[163],"but":[164],"also":[165,187],"reliability":[166],"extending":[168],"combined":[170],"their":[173,208],"reliable":[174],"variant.":[175],"We":[176,233],"compare":[177],"how":[178],"selection":[180],"appropriate":[183],"routing":[184],"strategies":[185],"may":[186],"be":[188],"determined":[189],"means":[191],"approach.":[194],"Finally,":[195],"order":[197],"cope":[199],"demand":[201],"uncertainty,":[202],"extend":[204],"formulations":[206],"set-induced":[209],"robust":[210,213],"counterpart.":[211],"enables":[215],"accommodate":[217],"spatio-temporal":[218],"variations":[219],"demands":[221],"traffic":[224],"instance":[226],"without":[227],"compromising":[228],"solution":[231],"quality.":[232],"conclude":[234],"outlining":[238],"some":[239],"main":[242],"research":[243],"both":[249],"modeling":[250],"level.":[253]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}