Parallel algorithms for singular value decomposition (SVD) have risen to prominence as an indispensable tool in high-performance numerical linear algebra. They offer significant improvements in the ...

We show that the combination of dynamic programming with partial-order decomposition algorithms enables us to solve sequencing problems in polynomial time for substantially larger classes of ...

Part I of this paper presented a method for primal decomposition of large convex separable programs into a sequence of smaller subproblems. In this part, additional theory and development of a ...

In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...