Given a directed graph with capacities and blocker costs associated with its arcs, we study the maximum flow blocker problem (MFBP) which asks to find a minimum-cost subset of arcs to be removed from the graph in such a way that the remaining maximum-flow value does not exceed a given threshold....

This paper derives school-to-work transition pathways in the United States and Europe between the late 1990s and the early 2000s. To do so, it uses Optimal Matching, a technique developed to sequence DNA. The key advantage of using this technique is that, rather than focusing on a specific point...