Earliest arrival flows on series-parallel graphs
From MaRDI portal
Publication:3082606
DOI10.1002/net.20398zbMath1207.90041MaRDI QIDQ3082606
Stefan Ruzika, Heike Sperber, Mechthild Steiner
Publication date: 16 March 2011
Published in: Networks (Search for Journal in Brave)
Full work available at URL: http://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2137
polynomial algorithms; discrete time setting; series-parallel graphs; dynamic network flows; earliest arrival flows; universally maximal dynamic flows
90B22: Queues and service in operations research
90B10: Deterministic network models in operations research