{"title":"A Labeling Algorithm for the Earliest and Latest Time-Varying Maximum Flow Problems","authors":"Jianming Zhu, D. Sha","doi":"10.1109/BCGIN.2011.89","DOIUrl":null,"url":null,"abstract":"The time-varying maximum flow problem is to find the maximum flow in a time-varying network. A time-varying network is the network which the transit time and the capacity of an arc are functions of the departure time at the beginning node of an arc. The earliest (or the latest) maximum flow is the maximum flow could be sent from the source node to the sink node in the time-varying network within the given time duration with the earliest (or the latest) arrival time. We assume that the transit time and the capacity of an arc are positive integers, and waiting at any node is prohibited except the source node. The problem is known to be NP-complete. A labeling algorithms is proposed for solving problems in pseudo polynomial time.","PeriodicalId":127523,"journal":{"name":"2011 International Conference on Business Computing and Global Informatization","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Business Computing and Global Informatization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BCGIN.2011.89","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The time-varying maximum flow problem is to find the maximum flow in a time-varying network. A time-varying network is the network which the transit time and the capacity of an arc are functions of the departure time at the beginning node of an arc. The earliest (or the latest) maximum flow is the maximum flow could be sent from the source node to the sink node in the time-varying network within the given time duration with the earliest (or the latest) arrival time. We assume that the transit time and the capacity of an arc are positive integers, and waiting at any node is prohibited except the source node. The problem is known to be NP-complete. A labeling algorithms is proposed for solving problems in pseudo polynomial time.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
