In this article, we explore additional methods to assign people to voting centers, such that the average distance that each person must travel is minimized. We use Optimal Transport, the Stable Assignment problem and linear programming. We review each method’s mechanism, the results that it achieves, and its computational complexity and possible drawbacks.
