One of the most classic algorithmic problems deals with calculating the shortest path between two points. A more complicated variant of the problem is when the route traverses a changing network - ...

We consider the specialization of the primal simplex algorithm to the problem of finding a tree of directed shortest paths from a given node to all other nodes in a network of n nodes or finding a ...

Military Operations Research, Vol. 14, No. 3 (2009), pp. 31-52 (22 pages) We formulate and solve aircraftrouting problems that arise when planning missions for military aircraft that are subject to ...

In the teaching of computer science, metaphors and analogies are especially fitting: the essence of algorithms is abstract discrete structures, and to help learners quickly grasp the logic within, we ...

If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle the easiest pieces first. But this kind of sorting has a cost.