Results 1 to 10 of about 189,238 (297)
In this paper, the notion of stability is extended to network flows over time. As a useful device in our proofs, we present an elegant preflow-push variant of the Gale-Shapley algorithm that operates directly on the given network and computes stable ...
Jannik Matuschke +2 more
doaj +5 more sources
Graph orientation and flows over time [PDF]
Flows over time are used to model many real‐world logistic and routing problems. The networks underlying such problems—streets, tracks, etc.—are inherently undirected and directions are only imposed on them to reduce the danger of colliding vehicles and similar problems.
Arulselvan, Ashwin +2 more
core +8 more sources
On the Price of Anarchy for flows over time [PDF]
Dynamic network flows, or network flows over time, constitute an important model for real-world situations in which steady states are unusual, such as urban traffic and the internet. These applications immediately raise the issue of analyzing dynamic network flows from a game-theoretic perspective.
José Correa 0001 +2 more
openaire +5 more sources
Algorithms for flows over time with scheduling costs [PDF]
AbstractFlows over time have received substantial attention from both an optimization and (more recently) a game-theoretic perspective. In this model, each arc has an associated delay for traversing the arc, and a bound on the rate of flow entering the arc; flows are time-varying.
Dario Frascaria, Neil Olver
openaire +7 more sources
Data for the ins and outs of involuntary part-time employment
Data are US monthly time series of involuntary part-time employment stocks and flows from 1976 until 2019 (covering five economic downturns), derived from the US Current Population Survey (CPS).
Daniel Borowczyk-Martins, Etienne Lalé
doaj +1 more source
This article explores the analysis of magnetized blood-based nanofluids flows over an extending cylinder. The nanofluid contains copper, copper oxide and iron oxide nanoparticles which are mixed with blood.
Showkat Ahmad Lone +5 more
doaj +1 more source
Braess’s Paradox for Flows over Time [PDF]
19 pages, 6 figures, an extended version of paper accepted for SAGT ...
Martin Macko +2 more
openaire +3 more sources
In this paper we show that every maximum minimum-cost flow over time problem has an optimal solution with a repeated structure if the given time horizon is large enough.
Miriam Schlöter, Robert Weismantel
openaire +2 more sources
Convergence of a Packet Routing Model to Flows over Time [PDF]
Mathematical approaches for modeling dynamic traffic can be roughly divided into two categories: discrete packet routing models and continuous flow over time models. Despite very vital research activities on models in both categories, their connection was poorly understood so far.
Leon Sering +2 more
openaire +2 more sources
Flows over Time with Load-Dependent Transit Times [PDF]
Flow variation over time is an important feature in network flow problems arising in various applications such as road or air traffic control, production systems, communication networks (e.g., the Internet), and financial flows. Another crucial phenomenon in many of those applications is that the time taken to traverse an edge varies with the current ...
Ekkehard Köhler, Martin Skutella
openaire +3 more sources

