Dynamic network flows, or network flows over time, constitute an important model for real-
world situations where steady states are unusual, such as urban traffic and the Internet …

A fluid queuing network constitutes one of the simplest models in which to study flow
dynamics over a network. In this model we have a single source-sink pair, and each link has …

We consider a dynamic model of traffic that has received a lot of attention in the past few
years. Infinitesimally small agents aim to travel from a source to a destination as quickly as …

We introduce and study a discrete multi-period extension of the classical knapsack problem,
dubbed generalized incremental knapsack. In this setting, we are given a set of n items …

This thesis studies the dynamic equilibrium behavior in traffic networks and it is motivated by
rush-hour congestion. It is well understood that one of the key causes of traffic congestion …

We consider a dynamic model of traffic that has received a lot of attention in the past few
years. Users control infinitesimal flow particles aiming to travel from a source to destination …

We study a dynamic traffic assignment model, where agents base their instantaneous
routing decisions on real-time delay predictions. We formulate a mathematically concise …

We consider dynamic equilibria for flows over time under the fluid queuing model. In this
model, queues on the links of a network take care of flow propagation. Flow enters the …

We study a dynamic traffic assignment model, where agents base their instantaneous
routing decisions on real-time delay predictions. We formulate a mathematically concise …

We consider flows over time within the deterministic queueing model of Vickrey and study
the solution concept of instantaneous dynamic equilibrium (IDE), in which flow particles …