{"id":"https://openalex.org/W2017080286","doi":"https://doi.org/10.1109/glocom.2014.7036988","title":"Methods for time-dependent combined network design and routing optimization","display_name":"Methods for time-dependent combined network design and routing optimization","publication_year":2014,"publication_date":"2014-12-01","ids":{"openalex":"https://openalex.org/W2017080286","doi":"https://doi.org/10.1109/glocom.2014.7036988","mag":"2017080286"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2014.7036988","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2014.7036988","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Global Communications Conference","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/A5075262684","display_name":"Dimitri B. Papadimitriou","orcid":"https://orcid.org/0000-0002-7677-9271"},"institutions":[{"id":"https://openalex.org/I72090969","display_name":"Nokia (United States)","ror":"https://ror.org/038km2573","country_code":"US","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I72090969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dimitri Papadimitriou","raw_affiliation_strings":["Alcatel-Lucent Bell Labs, Antwerp, Belgium","Alcatel-Lucent Bell Labs Antwerp, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Alcatel-Lucent Bell Labs, Antwerp, Belgium","institution_ids":[]},{"raw_affiliation_string":"Alcatel-Lucent Bell Labs Antwerp, Belgium","institution_ids":["https://openalex.org/I72090969"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083129489","display_name":"Bernard Fortz","orcid":"https://orcid.org/0000-0002-2355-8926"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Bernard Fortz","raw_affiliation_strings":["Departement d'Informatique, Universit\u00e9 Libre de Bruxelles, Brussels, Belgium","D\u00e9partement d\u2019informatique, Universit\u00e9 libre de Bruxelles, Brussels, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departement d'Informatique, Universit\u00e9 Libre de Bruxelles, Brussels, Belgium","institution_ids":["https://openalex.org/I132053463"]},{"raw_affiliation_string":"D\u00e9partement d\u2019informatique, Universit\u00e9 libre de Bruxelles, Brussels, Belgium","institution_ids":["https://openalex.org/I132053463"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.8553,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.90974514,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1303","last_page":"1309"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10847","display_name":"Advanced Optical Network Technologies","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.994700014591217,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9873999953269958,"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.6994070410728455},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.693080723285675},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6362866759300232},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5907824039459229},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.573693573474884},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5187554359436035},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.487762987613678},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.447672039270401},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.43906164169311523},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23044010996818542},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19662681221961975},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11391231417655945}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6994070410728455},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.693080723285675},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6362866759300232},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5907824039459229},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.573693573474884},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5187554359436035},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.487762987613678},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.447672039270401},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.43906164169311523},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23044010996818542},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19662681221961975},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11391231417655945},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/glocom.2014.7036988","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2014.7036988","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Global Communications Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:dipot.ulb.ac.be:2013/220411","is_oa":false,"landing_page_url":"http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/220411","pdf_url":null,"source":{"id":"https://openalex.org/S4306401063","display_name":"D\u00e9p\u00f4t institutionnel de l'Universit\u00e9 libre de Bruxelles (Universit\u00e9 Libre de Bruxelles)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I132053463","host_organization_name":"Universit\u00e9 Libre de Bruxelles","host_organization_lineage":["https://openalex.org/I132053463"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"In: IEEE Global Communications Conference, GLOBECOM 2014, Austin, TX, USA, December 8-12, 2014","raw_type":"info:eu-repo/semantics/conferencePaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321454","display_name":"Belgian Federal Science Policy Office","ror":"https://ror.org/01fapfv42"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W92685995","https://openalex.org/W1481170590","https://openalex.org/W1968143987","https://openalex.org/W1975387421","https://openalex.org/W1993229082","https://openalex.org/W2026531517","https://openalex.org/W2033982654","https://openalex.org/W2044121814","https://openalex.org/W2081979535","https://openalex.org/W2083931873","https://openalex.org/W2105560970","https://openalex.org/W2127635925","https://openalex.org/W2139211712","https://openalex.org/W2155526624","https://openalex.org/W2519703157","https://openalex.org/W2613070411","https://openalex.org/W2798566347","https://openalex.org/W3152144913","https://openalex.org/W4242130683"],"related_works":["https://openalex.org/W2086397253","https://openalex.org/W2133122801","https://openalex.org/W600422426","https://openalex.org/W4285278887","https://openalex.org/W2365237642","https://openalex.org/W2995925505","https://openalex.org/W2773399470","https://openalex.org/W3116484972","https://openalex.org/W2941986668","https://openalex.org/W4232431455"],"abstract_inverted_index":{"The":[0,95,132],"combined":[1],"network":[2,23,116],"design":[3,24],"and":[4,26,57,101,118,121,146],"(distributed)":[5],"traffic":[6,119],"routing":[7,27],"problem":[8,21],"can":[9,135],"be":[10,137],"formulated":[11],"as":[12],"a":[13,36,112],"large-scale":[14],"multi-period":[15],"mixed":[16],"integer":[17],"optimization":[18],"problem.":[19],"This":[20],"combines":[22],"decisions":[25],"decisions,":[28],"with":[29,59,126],"time-dependent":[30],"demands.":[31],"In":[32,73],"[1],":[33],"we":[34,76],"proposed":[35],"compact":[37],"formulation":[38,71,80,100,129,134],"based":[39],"on":[40,52,111],"the":[41,64,90,98,102,127],"aggregation":[42],"of":[43,92,97,115,130],"flows":[44,82],"by":[45,85],"destination.":[46],"We":[47],"observed":[48],"that":[49,69],"its":[50],"resolution":[51,142],"realistic":[53],"instances":[54],"becomes":[55],"intractable":[56],"unscalable":[58],"state-of-the-art":[60],"solvers":[61],"due":[62],"to":[63,106,123],"weak":[65],"linear":[66],"programming":[67],"bound":[68],"this":[70,74],"provides.":[72],"paper,":[75],"consider":[77],"an":[78],"extended":[79,99,133],"where":[81],"are":[83,109],"decomposed":[84],"origin-destination":[86],"pairs,":[87],"while":[88],"keeping":[89],"requirement":[91],"destination-based":[93],"routing.":[94],"quality":[96],"computational":[103],"time":[104],"needed":[105],"solve":[107],"it":[108],"evaluated":[110],"representative":[113],"set":[114],"topologies":[117],"demands,":[120],"compared":[122],"results":[124],"obtained":[125],"base":[128],"[1].":[131],"then":[136],"considered":[138],"for":[139],"more":[140],"efficient":[141],"methods":[143],"involving":[144],"decomposition":[145],"cutting":[147],"planes":[148],"approaches.":[149]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}