S. Thomas McCormick
S. Thomas McCormick
Professor of Management, Sauder School of Business
Verified email at
Cited by
Cited by
Sequencing in an assembly line with blocking to minimize cycle time
ST McCormick, ML Pinedo, S Shenker, B Wolf
Operations Research 37 (6), 925-935, 1989
The complexity of finding two disjoint paths with min-max objective function
CL Li, ST McCormick, D Simchi-Levi
Discrete Applied Mathematics 26 (1), 105-115, 1990
Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem
ST McCormick
Mathematical Programming 26 (2), 153-171, 1983
Submodular function minimization
ST McCormick
Handbooks in operations research and management science 12, 321-391, 2005
Finding disjoint paths with different path‐costs: Complexity and algorithms
CL Li, S Thomas McCormick, D Simchi‐Levi
Networks 22 (7), 653-667, 1992
Incentives for transshipment in a supply chain with decentralized retailers
J Shao, H Krishnan, ST McCormick
Manufacturing & Service Operations Management 13 (3), 361-372, 2011
Fast algorithms for parametric scheduling come from extensions to parametric maximum flow
ST McCormick
Proceedings of the twenty-eighth annual ACM symposium on theory of computing …, 1996
Polynomial methods for separable convex optimization in unimodular linear spaces with applications
AV Karzanov, ST McCormick
SIAM Journal on Computing 26 (4), 1245-1275, 1997
On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems
CL Li, ST McCormick, D Simchi-Levi
Operations Research Letters 11 (5), 303-308, 1992
Easy and difficult objective functions for max cut
ST McCormick, MR Rao, G Rinaldi
Mathematical programming 94, 459-466, 2003
Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis
ST McCormick, ML Pinedo
ORSA Journal on Computing 7 (1), 63-77, 1995
A combinatorial approach to some sparse matrix problems
ST McCormick
Stanford University, 1983
A polynomial algorithm for multiprocessor scheduling with two job lengths
ST McCormick, SR Smallwood, FCR Spieksma
Mathematics of Operations Research 26 (1), 31-49, 2001
Two strongly polynomial cut cancelling algorithms for minimum cost network flow
TR Ervolina, ST McCormick
Discrete Applied Mathematics 46 (2), 133-165, 1993
The point-to-point delivery and connection problems: Complexity and algorithms
CL Li, ST McCormick, D Simchi-Levi
Discrete Applied Mathematics 36 (3), 267-292, 1992
Computing maximum mean cuts
ST McCormick, TR Ervolina
Discrete Applied Mathematics 52 (1), 53-70, 1994
Some complexity results in cyclic scheduling
ST McCormick, US Rao
Mathematical and Computer Modelling 20 (2), 107-122, 1994
Gray markets and supply chain incentives
J Shao, H Krishnan, ST McCormick
Production and Operations Management 25 (11), 1807-1819, 2016
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
ST McCormick, S Fujishige
Mathematical Programming 122 (1), 87-120, 2010
Locating independent facilities with maximum weight: Greedy heuristics
SS Chaudhry, ST McCormick, ID Moon
Omega 14 (5), 383-389, 1986
The system can't perform the operation now. Try again later.
Articles 1–20