S. Thomas McCormick

Cited by

	All	Since 2018
Citations	2896	727
h-index	28	14
i10-index	53	25

160

120

1989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202314 21 12 29 40 27 36 37 53 35 61 70 48 68 53 61 104 92 91 82 89 94 115 142 105 120 107 150 136 132 121 141 106 156 71

Public access

View all

5 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
Jannik MatuschkeKU LeuvenVerified email at kuleuven.be
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
Pierre PesneauUniversité de Bordeaux, IMB, Inria Bordeaux Sud-OuestVerified email at math.u-bordeaux.fr
Bernard FortzUniversité Libre de BruxellesVerified email at ulb.be
Alan Hoffmanmathematician IBMVerified email at us.ibm.com
Akiyoshi SHIOURATokyo Institute of TechnologyVerified email at m.titech.ac.jp
Martin SkutellaProfessor 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	409	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	210	1990
Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem ST McCormick Mathematical Programming 26 (2), 153-171, 1983	190	1983
Submodular function minimization ST McCormick Handbooks in operations research and management science 12, 321-391, 2005	170	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	124	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	110	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	96	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	79	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	71	1992
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	69	1995
A Combinatorial Approach to Some Sparse Matrix Problems. ST McCormick STANFORD UNIV CA SYSTEMS OPTIMIZATION LAB, 1983	66	1983
Easy and difficult objective functions for max cut ST McCormick, MR Rao, G Rinaldi Mathematical programming 94, 459-466, 2003	63	2003
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
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	55	2001
Two strongly polynomial cut cancelling algorithms for minimum cost network flow TR Ervolina, ST McCormick Discrete Applied Mathematics 46 (2), 133-165, 1993	53	1993
Computing maximum mean cuts ST McCormick, TR Ervolina Discrete Applied Mathematics 52 (1), 53-70, 1994	52*	1994
Some complexity results in cyclic scheduling ST McCormick, US Rao Mathematical and Computer Modelling 20 (2), 107-122, 1994	49	1994
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization ST McCormick, S Fujishige Mathematical Programming 122 (1), 87, 2010	45	2010
A hierarchical algorithm for making sparse matrices sparser SF Chang, ST McCormick Mathematical Programming 56 (1-3), 1-30, 1992	43	1992
Locating independent facilities with maximum weight: Greedy heuristics SS Chaudhry, ST McCormick, ID Moon Omega 14 (5), 383-389, 1986	42	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