Related papers: Minimum-Peak-Cost Flows Over Time
We study an entropic optimal transport problem in which the transport plan is penalized by a nonlinear convex functional acting on the coupling. We establish existence, uniqueness, and uniform a priori bounds for minimizers, and we show…
Emerging reconfigurable optical communication technologies allow to enhance datacenter topologies with demand-aware links optimized towards traffic patterns. This paper studies the algorithmic problem of jointly optimizing topology and…
This study addresses the urban transit pattern design problem, optimizing stop sequences, headways, and fleet sizes across multiple routes and periods simultaneously to minimize user costs (composed of riding, waiting, and transfer times)…
Task allocation problems have traditionally focused on cost optimization. However, more and more attention is being given to cases in which cost should not always be the sole or major consideration. In this paper we study a fair task…
Congestion pricing has become an effective instrument for traffic demand management on road networks. This paper proposes an optimal control approach for congestion pricing for day-to-day timescale that incorporates demand uncertainty and…
In the Time-Windows Unsplittable Flow on a Path problem (twUFP) we are given a resource whose available amount changes over a given time interval (modeled as the edge-capacities of a given path $G$) and a collection of tasks. Each task is…
Millions of flows are routed concurrently through a modern data-center. These networks are often built as Clos topologies, and flow demands are constrained only by the link capacities at the ingress and egress points. The minimum congestion…
In potential flow networks, the equilibrium flow rates are usually not proportional to the demands and flow control elements are required to regulate the flow. The control elements can broadly be classified into two types - discrete and…
In the unsplittable flow problem on a path, we are given a capacitated path $P$ and $n$ tasks, each task having a demand, a profit, and start and end vertices. The goal is to compute a maximum profit set of tasks, such that for each edge…
This article focuses on a biobjective extension of the maximum flow network interdiction problem, where each arc in the network is associated with two capacity values. Two maximum flows from a source to a sink are to be computed…
The \emph{turnpike property} in contemporary macroeconomics asserts that if an economic planner seeks to move an economy from one level of capital to another, then the most efficient path, as long as the planner has enough time, is to…
We consider some flow-time minimization problems in the unrelated machines setting. In this setting, there is a set of $m$ machines and a set of $n$ jobs, and each job $j$ has a machine dependent processing time of $p_{ij}$ on machine $i$.…
We introduce a new approach to the maximum flow problem in undirected, capacitated graphs using $\alpha$-\emph{congestion-approximators}: easy-to-compute functions that approximate the congestion required to route single-commodity demands…
In a temporal graph, each edge is available at specific points in time. Such an availability point is often represented by a ''temporal edge'' that can be traversed from its tail only at a specific departure time, for arriving in its head…
Many robotics domains use some form of nonconvex model predictive control (MPC) for planning, which sets a reduced time horizon, performs trajectory optimization, and replans at every step. The actual task typically requires a much longer…
Numerous networks, such as transportation, distribution and delivery networks optimize their designs in order to increase efficiency and lower costs, improving the stability of its intended functions, etc. Networks that distribute goods,…
In this paper, we study the Maximum-Profit Routing Problem with Variable Supply (MPRP-VS). This is a more general version of the Maximum-Profit Public Transportation Route Planning Problem, or simply Maximum-Profit Routing Problem (MPRP),…
This paper presents a framework to incorporate ride-pooling from a mesoscopic point of view, within time-invariant network flow models of Mobility-on-Demand systems. The resulting problem structure remains identical to a standard network…
We study single commodity network flows with suitable robustness and efficiency specs. An original use of a maximum entropy problem for distributions on the paths of the graph turns this problem into a steering problem for Markov chains…
We present a new approach to the minimum-cost integral flow problem for small values of the flow. It reduces the problem to the tests of simple multi-variate polynomials over a finite field of characteristic two for non-identity with zero.…