McCormick S. Thomas

S. Thomas McCormick

Information about the author S. Thomas McCormick will soon be added to the site.
Found 12 papers in total
Selected papers of Alan J. Hoffman with commentary
Selected papers of Alan J. Hoffman with commentary
2005
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
2000
This paper shows that the minimum ratio canceling algorithm of Wallacher (and a faster...
Fast algorithms for parametric scheduling come from extensions to parametric maximum flow
Fast algorithms for parametric scheduling come from extensions to parametric maximum flow
1999
Chen develops an attractive variant of the classical problem of preemptively...
How to compute least infeasible flows
How to compute least infeasible flows
1997
It is well-known how to use maximum flow to decide when a flow problem with demands,...
Scheduling n independent jobs on m uniform machines with both flowtime and makespan objectives: A parametric analysis
Scheduling n independent jobs on m uniform machines with both flowtime and makespan objectives: A parametric analysis
1995
We consider the problem of scheduling n jobs without precedence constraints on m...
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...
On the Minimum-Cardinality-Bounded-Diameter and the Bounded-Cardinality-Minimum-Diameter Edge Addition Problems
On the Minimum-Cardinality-Bounded-Diameter and the Bounded-Cardinality-Minimum-Diameter Edge Addition Problems
1992
Given a graph G=(V,E), positive integers D<ℝVℝ and B, the...
A hierarchical algorithm for making sparse matrices sparser
A hierarchical algorithm for making sparse matrices sparser
1992
If A is the (sparse) coefficient matrix of linear equality constraints, for what...
Making sparse matrices sparser: Computational results
Making sparse matrices sparser: Computational results
1990
Many optimization algorithms involve repeated processing of a fixed set of linear...
Transient behavior in a flexible assembly system
Transient behavior in a flexible assembly system
1991
The authors consider an assembly line with m stations in series having finite-capacity...
Integral infeasibility and testing total dual integrality
Integral infeasibility and testing total dual integrality
1991
A number of well known results in combinatorial optimization, such as Hoffman’s...
Sequencing in an assembly line with blocking to minimize cycle time
Sequencing in an assembly line with blocking to minimize cycle time
1989
The authors consider an assembly line with m stations in series having finite capacity...
Papers per page: