{"id":"https://openalex.org/W2766680383","doi":"https://doi.org/10.3233/fi-2017-1600","title":"The Maximum Parametric Flow in Discrete-time Dynamic Networks","display_name":"The Maximum Parametric Flow in Discrete-time Dynamic Networks","publication_year":2017,"publication_date":"2017-10-31","ids":{"openalex":"https://openalex.org/W2766680383","doi":"https://doi.org/10.3233/fi-2017-1600","mag":"2766680383"},"language":"en","primary_location":{"id":"doi:10.3233/fi-2017-1600","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2017-1600","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","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/A5059798504","display_name":"Nicoleta Avesalon","orcid":null},"institutions":[{"id":"https://openalex.org/I3123573182","display_name":"Transylvania University of Bra\u0219ov","ror":"https://ror.org/01cg9ws23","country_code":"RO","type":"education","lineage":["https://openalex.org/I3123573182"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Nicoleta Avesalon","raw_affiliation_strings":["Faculty of Mathematics and Computer Science, Transilvania University of Bra\u015fov, Eroilor blvd 25, 500030 Brasov, Romania. ,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Computer Science, Transilvania University of Bra\u015fov, Eroilor blvd 25, 500030 Brasov, Romania. ,","institution_ids":["https://openalex.org/I3123573182"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028806136","display_name":"Eleonor Ciurea","orcid":null},"institutions":[{"id":"https://openalex.org/I3123573182","display_name":"Transylvania University of Bra\u0219ov","ror":"https://ror.org/01cg9ws23","country_code":"RO","type":"education","lineage":["https://openalex.org/I3123573182"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Eleonor Ciurea","raw_affiliation_strings":["Faculty of Mathematics and Computer Science, Transilvania University of Bra\u015fov, Eroilor blvd 25, 500030 Brasov, Romania. ,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Computer Science, Transilvania University of Bra\u015fov, Eroilor blvd 25, 500030 Brasov, Romania. ,","institution_ids":["https://openalex.org/I3123573182"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047744454","display_name":"Mircea Parpalea","orcid":null},"institutions":[{"id":"https://openalex.org/I4210128036","display_name":"Universitatea Andrei \u015eaguna","ror":"https://ror.org/031p96b92","country_code":"RO","type":"education","lineage":["https://openalex.org/I4210128036"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Mircea Parpalea","raw_affiliation_strings":["National College Andrei \u015eaguna, \u015eaguna str. 1, 590000, Brasov, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National College Andrei \u015eaguna, \u015eaguna str. 1, 590000, Brasov, Romania","institution_ids":["https://openalex.org/I4210128036"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047744454"],"corresponding_institution_ids":["https://openalex.org/I4210128036"],"apc_list":null,"apc_paid":null,"fwci":0.1984,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.53526719,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"156","issue":"2","first_page":"125","last_page":"139"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10524","display_name":"Traffic control and management","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10524","display_name":"Traffic control and management","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T11195","display_name":"Simulation Techniques and Applications","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.774267315864563},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.6157149076461792},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.5939582586288452},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5739943981170654},{"id":"https://openalex.org/keywords/discrete-time-and-continuous-time","display_name":"Discrete time and continuous time","score":0.5726870894432068},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.571192741394043},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5271227955818176},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5187852382659912},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.4859001040458679},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47602608799934387},{"id":"https://openalex.org/keywords/dynamic-network-analysis","display_name":"Dynamic network analysis","score":0.46920815110206604},{"id":"https://openalex.org/keywords/out-of-kilter-algorithm","display_name":"Out-of-kilter algorithm","score":0.4538721442222595},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45357030630111694},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.4467485547065735},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4399329721927643},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.13166126608848572},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11048895120620728},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09504610300064087},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08241826295852661},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06715992093086243},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.0647503137588501}],"concepts":[{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.774267315864563},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.6157149076461792},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.5939582586288452},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5739943981170654},{"id":"https://openalex.org/C55689738","wikidata":"https://www.wikidata.org/wiki/Q15963867","display_name":"Discrete time and continuous time","level":2,"score":0.5726870894432068},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.571192741394043},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5271227955818176},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5187852382659912},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.4859001040458679},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47602608799934387},{"id":"https://openalex.org/C13540734","wikidata":"https://www.wikidata.org/wiki/Q5318996","display_name":"Dynamic network analysis","level":2,"score":0.46920815110206604},{"id":"https://openalex.org/C133824558","wikidata":"https://www.wikidata.org/wiki/Q16893660","display_name":"Out-of-kilter algorithm","level":5,"score":0.4538721442222595},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45357030630111694},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.4467485547065735},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4399329721927643},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.13166126608848572},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11048895120620728},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09504610300064087},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08241826295852661},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06715992093086243},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.0647503137588501},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/fi-2017-1600","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2017-1600","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W587169018","https://openalex.org/W1977545325","https://openalex.org/W1982800744","https://openalex.org/W1983383464","https://openalex.org/W2013731263","https://openalex.org/W2042220326","https://openalex.org/W2043295480","https://openalex.org/W2091413867","https://openalex.org/W2119098384","https://openalex.org/W2472803461"],"related_works":["https://openalex.org/W2098682899","https://openalex.org/W2080904092","https://openalex.org/W3035974271","https://openalex.org/W4206915070","https://openalex.org/W3161514703","https://openalex.org/W3141113327","https://openalex.org/W2625547693","https://openalex.org/W2531764854","https://openalex.org/W2355612523","https://openalex.org/W2032247582"],"abstract_inverted_index":{"This":[0],"article":[1],"states":[2],"and":[3,56,103],"solves":[4],"the":[5,19,42,46,51,57,61,77,81,85,89,94,99,111],"maximum":[6,20,47,62],"parametric":[7,63],"flow":[8,22,65,70],"over":[9],"time":[10,53,91],"problem.":[11],"The":[12,68,96],"proposed":[13],"approach":[14],"consists":[15],"in":[16,23,33,84],"repeatedly":[17],"finding":[18],"dynamic":[21,25,64,69],"discrete":[24],"networks,":[26],"for":[27,60],"a":[28],"sequence":[29],"of":[30,39,93,98],"parameter":[31],"values,":[32],"their":[34],"increasing":[35],"order.":[36],"In":[37],"each":[38],"its":[40],"iterations,":[41],"algorithm":[43,100,112],"computes":[44],"both":[45],"flow,":[48],"by":[49],"minimizing":[50],"transit":[52],"(quickest":[54],"flow),":[55],"new":[58],"breakpoint":[59],"value":[66],"function.":[67],"is":[71,101,107],"augmented":[72],"along":[73],"quickest":[74],"paths":[75],"from":[76],"source":[78],"node":[79,83],"to":[80],"sink":[82],"time-space":[86],"network,":[87],"avoiding":[88],"explicit":[90],"expansion":[92],"network.":[95],"complexity":[97],"presented":[102],"also":[104],"an":[105],"example":[106],"given":[108],"on":[109],"how":[110],"works.":[113]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}