English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

Flows over time generalize classical network flows by introducing a notion oftime. Each arc is equipped with a transit time that specifies how long flowtakes to traverse it, while flow rates may vary over time within the given edgecapacities. In this paper, we extend this concept of a dynamic optimizationproblem to the more general setting of abstract flows. In this model, theunderlying network is replaced by an abstract system of linearly ordered sets,called "paths" satisfying a simple switching property: Whenever two paths P andQ intersect, there must be another path that is contained in the beginning of Pand the end of Q.  We show that a maximum abstract flow over time can be obtained by solving aweighted abstract flow problem and constructing a temporally repeated flow fromits solution. In the course of the proof, we also show that the relativelymodest switching property of abstract networks already captures many essentialproperties of classical networks.

Abstract flows over time: A first step towards solving dynamic packing problems