S. Thomas McCormick

Cited by

	All	Since 2019
Citations	3036	732
h-index	29	15
i10-index	54	25

160

120

19891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202415 26 12 32 41 23 33 37 52 37 49 69 48 69 52 59 106 93 91 82 91 100 112 143 109 123 105 146 134 131 122 134 93 156 126 98

Public access

View all

7 articles

4 articles

available

not available

Based on funding mandates

Co-authors

Satoru IwataUniversity of TokyoVerified email at mist.i.u-tokyo.ac.jp
David Simchi-LeviProfessor of Engineering Systems at MITVerified email at mit.edu
Michael PinedoJulius Schlesinger Professor of Operations Management, Stern School of Business, New York UniversityVerified email at stern.nyu.edu
Harish KrishnanSauder School of Business, University of British ColumbiaVerified email at sauder.ubc.ca
Scott ShenkerProfessor of Computer Science, UC BerkeleyVerified email at icsi.berkeley.edu
A. Ridha MahjoubProfessor of Operations Research, Université Paris-DauphineVerified email at lamsade.dauphine.fr
M. Rammohan Rao or M. R. RaoProfessor Emeritus, Indian School of Business HyderabadVerified email at isb.edu
Hassene AissiUniversité Paris DauphineVerified email at lamsade.dauphine.fr
Sohail S. ChaudhryVillanova UniversityVerified email at villanova.edu
Frits SpieksmaTU EindhovenVerified email at tue.nl
Yichuan DingDesautels Faculty of Management, McGill UniversityVerified email at mcgill.ca
Jannik MatuschkeKU LeuvenVerified email at kuleuven.be
Pierre PesneauUniversité de Bordeaux, IMB, Inria Bordeaux Sud-OuestVerified email at math.u-bordeaux.fr
Bernard FortzHEC Liége, management school of the University of LiègeVerified email at uliege.be
Alan Hoffmanmathematician IBMVerified email at us.ibm.com
Akiyoshi SHIOURATokyo Institute of TechnologyVerified email at m.titech.ac.jp
Martin SkutellaEinstein Professor of Mathematics and Computer Science, TU BerlinVerified email at tu-berlin.de
Tomomi MatsuiTokyo Institute of TechnologyVerified email at m.titech.ac.jp

S. Thomas McCormick

Professor of Management, Sauder School of Business

Verified email at sauder.ubc.ca

combinatorial optimization algorithms scheduling supply chain management submodular functions


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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	425	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	217	1990
Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem ST McCormick Mathematical Programming 26 (2), 153-171, 1983	199	1983
Submodular function minimization ST McCormick Handbooks in operations research and management science 12, 321-391, 2005	187	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	132	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	114	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	98	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	90*	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	73	1992
Easy and difficult objective functions for max cut ST McCormick, MR Rao, G Rinaldi Mathematical programming 94, 459-466, 2003	71	2003
A COMBINATORIAL APPROACH TO SOME SPARSE MATRIX PROBLEMS. STV MCCORMICK	69	1984
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	68	1995
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	61	2001
Two strongly polynomial cut cancelling algorithms for minimum cost network flow TR Ervolina, ST McCormick Discrete Applied Mathematics 46 (2), 133-165, 1993	58	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	57	1992
Computing maximum mean cuts ST McCormick, TR Ervolina Discrete Applied Mathematics 52 (1), 53-70, 1994	51*	1994
Some complexity results in cyclic scheduling ST McCormick, US Rao Mathematical and Computer Modelling 20 (2), 107-122, 1994	49	1994
Gray markets and supply chain incentives J Shao, H Krishnan, ST McCormick Production and Operations Management 25 (11), 1807-1819, 2016	48	2016
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization ST McCormick, S Fujishige Mathematical Programming 122 (1), 87-120, 2010	47	2010
Locating independent facilities with maximum weight: Greedy heuristics SS Chaudhry, ST McCormick, ID Moon Omega 14 (5), 383-389, 1986	47	1986

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors