S. Thomas McCormick

2008
30	EE	Maren Martens, S. Thomas McCormick: A Polynomial Algorithm for Weighted Abstract Flow. IPCO 2008: 97-111
29	EE	S. Thomas McCormick, Satoru Fujishige: Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization. SODA 2008: 44-53
28	EE	Egon Balas, Alan J. Hoffman, S. Thomas McCormick: A Special Issue in Memory of George B. Dantzig. Discrete Optimization 5(2): 145-150 (2008)
2006
27	EE	Bernard Fortz, Ali Ridha Mahjoub, S. Thomas McCormick, Pierre Pesneau: Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut. Math. Program. 105(1): 85-111 (2006)
2005
26	EE	Satoru Iwata, S. Thomas McCormick, Maiko Shigeno: A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow. SIAM J. Discrete Math. 19(2): 304-320 (2005)
2003
25	EE	Satoru Iwata, S. Thomas McCormick, Maiko Shigeno: Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*. Combinatorica 23(3): 503-525 (2003)
2001
24	EE	S. Thomas McCormick, Scott R. Smallwood, Frits C. R. Spieksma: A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths. Math. Oper. Res. 26(1): 31-49 (2001)
2000
23	EE	S. Thomas McCormick, Akiyoshi Shioura: Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks. SODA 2000: 944-952
22	EE	Satoru Iwata, S. Thomas McCormick, Maiko Shigeno: A fast cost scaling algorithm for submodular flow. Inf. Process. Lett. 74(3-4): 123-128 (2000)
21	EE	Maiko Shigeno, Satoru Iwata, S. Thomas McCormick: Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow. Math. Oper. Res. 25(1): 76-104 (2000)
20	EE	S. Thomas McCormick, Akiyoshi Shioura: Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks. Oper. Res. Lett. 27(5): 199-207 (2000)
1999
19	EE	Satoru Iwata, S. Thomas McCormick, Maiko Shigeno: A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem. IPCO 1999: 259-272
1998
18		Satoru Iwata, S. Thomas McCormick, Maiko Shigeno: A Faster Algorithm for Minimum Cost Submodular Flows. SODA 1998: 167-174
17	EE	Satoru Iwata, Tomomi Matsui, S. Thomas McCormick: A fast bipartite network flow algorithm for selective assembly. Oper. Res. Lett. 22(4-5): 137-143 (1998)
1997
16		S. Thomas McCormick, Scott R. Smallwood, Frits C. R. Spieksma: Polynomial Algorithms for Multiprocessor Scheduling with a Small Number of Job Lengths. SODA 1997: 509-517
15		S. Thomas McCormick: How to compute least infeasible flows. Math. Program. 77: 179-194 (1997)
14		Alexander V. Karzanov, S. Thomas McCormick: Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications. SIAM J. Comput. 26(4): 1245-1275 (1997)
1996
13		William H. Cunningham, S. Thomas McCormick, Maurice Queyranne: Integer Programming and Combinatorial Optimization, 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings Springer 1996
12		S. Thomas McCormick: A Polynomial Algorithm for Abstract Maximum Flow. SODA 1996: 490-497
11	EE	S. Thomas McCormick: Fast Algorithms for Parametric Scheduling Come from Extensions to Parametric Maximum Flow. STOC 1996: 319-328
1995
10		Alexander V. Karzanov, S. Thomas McCormick: Polynomial Methods for Separable Convex Optimization in Unimodular Spaces. SODA 1995: 78-87
1994
9	EE	S. Thomas McCormick, Thomas R. Ervolina: Computing Maximum Mean Cuts. Discrete Applied Mathematics 52(1): 53-70 (1994)
1993
8		S. Thomas McCormick, Thomas R. Ervolina: Canceling most helpful total submodular cuts for submodular flow. IPCO 1993: 343-353
7	EE	Thomas R. Ervolina, S. Thomas McCormick: Two Strongly Polynomial Cut Cancelling Algorithms for Minimum Cost Network Flow. Discrete Applied Mathematics 46(2): 133-165 (1993)
6		S. Thomas McCormick, S. Frank Chang: The Weighted Sparsity Problem: Complexity and Algorithms. SIAM J. Discrete Math. 6(1): 57-69 (1993)
1992
5	EE	Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi: The point-to-point delivery and connection problems: complexity and algorithms. Discrete Applied Mathematics 36(3): 267-292 (1992)
4		S. Frank Chang, S. Thomas McCormick: A hierarchical algorithm for making sparse matrices sparser. Math. Program. 56: 1-30 (1992)
1991
3		S. Thomas McCormick: Making sparse matrices sparser: Computational results. Math. Program. 49: 91-111 (1991)
1990
2	EE	Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi: The complexity of finding two disjoint paths with min-max objective function. Discrete Applied Mathematics 26(1): 105-115 (1990)
1987
1	EE	Sohail S. Chaudhry, I. Douglas Moon, S. Thomas McCormick: Conditional covering: Greedy heuristics and computational results. Computers & OR 14(1): 11-18 (1987)

Coauthor Index

1	Egon Balas	[28]
2	S. Frank Chang	[4] [6]
3	Sohail S. Chaudhry	[1]
4	William H. Cunningham	[13]
5	Thomas R. Ervolina	[7] [8] [9]
6	Bernard Fortz	[27]
7	Satoru Fujishige	[29]
8	Alan J. Hoffman	[28]
9	Satoru Iwata	[17] [18] [19] [21] [22] [25] [26]
10	Alexander V. Karzanov	[10] [14]
11	Chung-Lun Li	[2] [5]
12	Ali Ridha Mahjoub	[27]
13	Maren Martens	[30]
14	Tomomi Matsui	[17]
15	I. Douglas Moon	[1]
16	Pierre Pesneau	[27]
17	Maurice Queyranne	[13]
18	Maiko Shigeno	[18] [19] [21] [22] [25] [26]
19	Akiyoshi Shioura	[20] [23]
20	David Simchi-Levi	[2] [5]
21	Scott R. Smallwood	[16] [24]
22	Frits C. R. Spieksma	[16] [24]

Colors in the list of coauthors