This tutorial is devoted to the notion of max-min fairness (MMF), associated optimization
problems, and their applications to multi-commodity flow networks. We first introduce a …

Optimization models related to designing and operating complex systems are mainly
focused on some efficiency metrics such as response time, queue length, throughput, and …

Conic optimization is a significant and thriving research area within the optimization
community. Conic optimization is the general class of problems concerned with optimizing a …

Submodular functions are relevant to machine learning for at least two reasons:(1) some
problems may be expressed directly as the optimization of submodular functions and (2) the …

The classical maximum flow problem sometimes occurs in settings in which the arc
capacities are not fixed but are functions of a single parameter, and the goal is to find the …

Recent studies on operational wireless LANs (WLANs) have shown that user load is often
unevenly distributed among wireless access points (APs). This unbalanced load results in …

Consolidation carriers transport shipments that are small relative to trailer capacity. To be
cost effective, the carrier must consolidate shipments, which requires coordinating their …

A dynamic network consists of a graph with capacities and transit times on its edges. The
quickest transshipment problem is defined by a dynamic network with several sources and …

We give an introduction into the fascinating area of flows over time—also called “dynamic
flows” in the literature. Starting from the early work of Ford and Fulkerson on maximum flows …

Maximizing network throughput while providing fairness is one of the key challenges in
wireless LANs (WLANs). This goal is typically achieved when the load of access points …