{"id":"https://openalex.org/W2002958336","doi":"https://doi.org/10.1002/net.3230180405","title":"Minimum\u2010delay routing in continuous\u2010time dynamic networks with Piecewise\u2010constant capacities","display_name":"Minimum\u2010delay routing in continuous\u2010time dynamic networks with Piecewise\u2010constant capacities","publication_year":1988,"publication_date":"1988-12-01","ids":{"openalex":"https://openalex.org/W2002958336","doi":"https://doi.org/10.1002/net.3230180405","mag":"2002958336"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230180405","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230180405","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-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/A5091221579","display_name":"R.G. Ogier","orcid":null},"institutions":[{"id":"https://openalex.org/I1298353152","display_name":"SRI International","ror":"https://ror.org/05s570m15","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I1298353152"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Richard G. Ogier","raw_affiliation_strings":["SRI International, 333 Ravenswood Ave., Menlo Park, California 94025"],"affiliations":[{"raw_affiliation_string":"SRI International, 333 Ravenswood Ave., Menlo Park, California 94025","institution_ids":["https://openalex.org/I1298353152"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5091221579"],"corresponding_institution_ids":["https://openalex.org/I1298353152"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.17490132,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"18","issue":"4","first_page":"303","last_page":"318"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9994000196456909,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9994000196456909,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9980999827384949,"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.9962000250816345,"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/piecewise","display_name":"Piecewise","score":0.7412524223327637},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.7202756404876709},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.674583911895752},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.6451432704925537},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5476707816123962},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5449863076210022},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5385825037956238},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4948849081993103},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.48460420966148376},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.47679781913757324},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.47373759746551514},{"id":"https://openalex.org/keywords/sink","display_name":"Sink (geography)","score":0.441273033618927},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4359099566936493},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4031502902507782},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28772756457328796},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.18503671884536743}],"concepts":[{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.7412524223327637},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.7202756404876709},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.674583911895752},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.6451432704925537},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5476707816123962},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5449863076210022},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5385825037956238},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4948849081993103},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.48460420966148376},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.47679781913757324},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.47373759746551514},{"id":"https://openalex.org/C143050476","wikidata":"https://www.wikidata.org/wiki/Q194502","display_name":"Sink (geography)","level":2,"score":0.441273033618927},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4359099566936493},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4031502902507782},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28772756457328796},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.18503671884536743},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230180405","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230180405","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1520524895","https://openalex.org/W1961192391","https://openalex.org/W1964119857","https://openalex.org/W2047907098","https://openalex.org/W2049626836","https://openalex.org/W2061028747","https://openalex.org/W2069323107","https://openalex.org/W2081013866","https://openalex.org/W2083050082","https://openalex.org/W2088045969","https://openalex.org/W2105688031","https://openalex.org/W4244424643"],"related_works":["https://openalex.org/W3035974271","https://openalex.org/W3141113327","https://openalex.org/W4206915070","https://openalex.org/W2080904092","https://openalex.org/W3161514703","https://openalex.org/W2531764854","https://openalex.org/W1994440468","https://openalex.org/W2368069542","https://openalex.org/W4311255633","https://openalex.org/W1970952976"],"abstract_inverted_index":{"Abstract":[0],"A":[1,36],"single\u2010source":[2],"single\u2010sink":[3],"dynamic":[4,41,79],"network":[5],"is":[6,24,39,60,67,84,106,113],"considered":[7,59],"where":[8,22,102],"the":[9,27,46,52,107,114,119,130],"link":[10,30],"flows":[11],"are":[12,34],"real\u2010valued":[13],"measurable":[14],"functions":[15],"defined":[16],"on":[17],"a":[18,40,64,74,77],"time":[19,55],"interval":[20],"and":[21,31,111],"storage":[23,32],"allowed":[25],"at":[26],"nodes.":[28],"Piecewise\u2010constant":[29],"capacities":[33,120],"given.":[35],"\u03c4\u2010maximum":[37,69],"flow":[38,42,65,75,90],"assignment":[43],"that":[44,61,118],"maximizes":[45],"total":[47],"amount":[48],"of":[49,62,109,116,132],"commodity":[50],"reaching":[51],"sink":[53],"before":[54],"\u03c4.":[56,72],"The":[57],"problem":[58],"computing":[63],"which":[66,86],"simultaneously":[68],"for":[70,129],"all":[71],"Such":[73],"solves":[76],"minimum\u2010delay":[78],"routing":[80],"problem.":[81],"An":[82],"algorithm":[83],"presented":[85],"computes":[87],"an":[88],"optimal":[89],"in":[91],"O":[92],"(":[93],"|":[94,96,103,105],"N":[95,104],"4":[97,99],"T":[98,112],")":[100],"time,":[101],"number":[108,115],"nodes":[110],"times":[117],"change.":[121],"Previous":[122],"polynomial\u2010time":[123],"algorithms":[124],"have":[125],"been":[126],"given":[127],"only":[128],"case":[131],"constant":[133],"capacities.":[134]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}