A team of computer scientists has come up with a dramatically faster algorithm for one of the oldest problems in computer science: maximum flow. The problem asks how much material can flow through a ...

In this paper, we introduce a branch-and-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem. The algorithm relies on a reformulation based on q-routes that combines two ...

In this paper, we investigate a routing problem arising in the last-mile delivery of small packages. The problem, called Multi-Depot Vehicle Routing Problem with Private fleet and Common carriers ...