Abstract Throughout its history, Operational Research has evolved to include methods,
models and algorithms that have been applied to a wide range of contexts. This …

As a consequence of the sharing economy attaining more popularity, there has been a shift
toward shared-use mobility services in recent years, especially those that encourage users …

We give an algorithm that computes exact maximum flows and minimum-cost flows on
directed graphs with m edges and polynomially bounded integral demands, costs, and …

We give a deterministic m^1+o(1) time algorithm that computes exact maximum flows and
minimum-cost flows on directed graphs with m edges and polynomially bounded integral …

Optimal transportation distances are a fundamental family of parameterized distances for
histograms in the probability simplex. Despite their appealing theoretical properties …

In this paper we provide new randomized algorithms with improved runtimes for solving
linear programs with two-sided constraints. In the special case of the minimum cost flow …

The purpose of this survey is to serve both as a gentle introduction and a coherent overview
of state-of-the-art Frank--Wolfe algorithms, also called conditional gradient algorithms, for …

In this paper, we present a new algorithm for'/solving linear programs that requires only Õ
(√ rank (A) L) iterations where A is the constraint matrix of a linear program with m …

Project scheduling is concerned with single-item or small batch production where scarce
resources have to be allocated to dependent activities over time. Applications can be found …

We present a new algorithm for a robust family of Earth Mover's Distances-EMDs with
thresholded ground distances. The algorithm transforms the flow-network of the EMD so that …