McCormick S.T.

S.T. McCormick

Information about the author S.T. McCormick will soon be added to the site.
Found 4 papers in total
A polynomial algorithm for multiprocessor scheduling with two job lengths
A polynomial algorithm for multiprocessor scheduling with two job lengths
2001
The following multiprocessor scheduling problem was motivated by scheduling...
A faster capacity scaling algorithm for minimum cost submodular flow
A faster capacity scaling algorithm for minimum cost submodular flow
2002
We describe an O( n 4 h min{log U , n 2 log n }) capacity scaling algorithm for the...
Submodular containment is hard, even for networks
Submodular containment is hard, even for networks
1996
Suppose that we have two submodular base polyhedra in the same space. What is the...
A fast bipartite network flow algorithm for selective assembly
A fast bipartite network flow algorithm for selective assembly
1998
Bipartite network flow problems naturally arise in applications such as selective...
Papers per page: