A Labeling Algorithm for the Earliest and Latest Time-Varying Maximum Flow Problems

Author

Zhu, Jianming ; Sha, Dan

Author_Institution

Bus. Inf. Manage. Sch., Shanghai Inst. of Foreign Trade, Shanghai, China

fYear

2011

fDate

29-31 July 2011

Firstpage

329

Lastpage

332

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.

Keywords

communication complexity; network theory (graphs); optimisation; NP-complete; departure time; labeling algorithm; positive integer; pseudopolynomial time; time-varying maximum flow problem; time-varying network; transit time; Complexity theory; Electronic mail; Heuristic algorithms; Information management; Labeling; Optimization; labeling algorithm; maximum flow; optimization; preflow; time-varying network;

fLanguage

English

Publisher

ieee

Conference_Titel

Business Computing and Global Informatization (BCGIN), 2011 International Conference on

Conference_Location

Shanghai

Print_ISBN

978-1-4577-0788-9

Electronic_ISBN

978-0-7695-4464-9

Type

conf

DOI

10.1109/BCGIn.2011.89

Filename

6003915