Cancel‐and‐tighten algorithm for quickest flow problems

Given a directed graph with a capacity and a transit time for each arc and with single source and single sink nodes, the quickest flow problem is to find the minimum time horizon to send a given amount of flow from the source to the sink. This is one of the fundamental dynamic flow problems. Paramet...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Networks Jg. 69; H. 2; S. 179 - 188
Hauptverfasser:	Saho, Masahide, Shigeno, Maiko
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Wiley Subscription Services, Inc 01.03.2017
Schlagworte:	Algorithms cancel and tighten algorithm Complexity Construction costs cost scaling dynamic flow Graph theory Minimum cost network optimization Networks Polynomials quickest flow strongly polynomial time algorithm Transit time
ISSN:	0028-3045, 1097-0037
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!