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 ...

This is a preview. Log in through your library . Abstract For the purpose of production scheduling, open-pit mines are discretized into three-dimensional arrays known as block models. Production ...

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 ...