Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
S. Thomas McCormick
2010 – today
- 2012
[j30]Frieda Granot, S. Thomas McCormick, Maurice Queyranne, Fabio Tardella: Structural and algorithmic properties for parametric minimum cuts. Math. Program. 135(1-2): 337-367 (2012)- 2011
- [j29]Jing Shao, Harish Krishnan, S. Thomas McCormick: Incentives for Transshipment in a Supply Chain with Decentralized Retailers. Manufacturing & Service Operations Management 13(3): 361-372 (2011)
- [c11]S. Thomas McCormick, Britta Peis: A Primal-Dual Algorithm for Weighted Abstract Cut Packing. IPCO 2011: 324-335
- 2010
- [j28]S. Thomas McCormick, Satoru Fujishige: Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization. Math. Program. 122(1): 87-120 (2010)
- [j27]Ali Ridha Mahjoub, S. Thomas McCormick: Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation. Math. Program. 124(1-2): 271-284 (2010)
- [j26]Maren Martens, S. Thomas McCormick, Maurice Queyranne: Separation, dimension, and facet algorithms for node flow polyhedra. Math. Program. 124(1-2): 317-348 (2010)
2000 – 2009
- 2008
- [j25]Egon Balas, Alan J. Hoffman, S. Thomas McCormick: A Special Issue in Memory of George B. Dantzig. Discrete Optimization 5(2): 145-150 (2008)
- [c10]Maren Martens, S. Thomas McCormick: A Polynomial Algorithm for Weighted Abstract Flow. IPCO 2008: 97-111
- [c9]S. Thomas McCormick, Satoru Fujishige: Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization. SODA 2008: 44-53
- 2006
- [j24]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
- [j23]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
- [j22]Satoru Iwata, S. Thomas McCormick, Maiko Shigeno: Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*. Combinatorica 23(3): 503-525 (2003)
- [j21]S. Thomas McCormick, M. R. Rao, Giovanni Rinaldi: Easy and difficult objective functions for max cut. Math. Program. 94(2-3): 459-466 (2003)
- 2002
- [j20]Lisa Fleischer, Satoru Iwata, S. Thomas McCormick: A faster capacity scaling algorithm for minimum cost submodular flow. Math. Program. 92(1): 119-139 (2002)
- 2001
- [j19]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
- [j18]Satoru Iwata, S. Thomas McCormick, Maiko Shigeno: A fast cost scaling algorithm for submodular flow. Inf. Process. Lett. 74(3-4): 123-128 (2000)
- [j17]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)
- [j16]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)
- [c8]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
1990 – 1999
- 1999
- [c7]Satoru Iwata, S. Thomas McCormick, Maiko Shigeno: A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem. IPCO 1999: 259-272
- 1998
- [j15]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)
- [c6]Satoru Iwata, S. Thomas McCormick, Maiko Shigeno: A Faster Algorithm for Minimum Cost Submodular Flows. SODA 1998: 167-174
- 1997
- [j14]
- [j13]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)
- [c5]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
- 1996
- [c4]
- [c3]S. Thomas McCormick: Fast Algorithms for Parametric Scheduling Come from Extensions to Parametric Maximum Flow. STOC 1996: 319-328
- [e1]William H. Cunningham, S. Thomas McCormick, Maurice Queyranne (Eds.): Integer Programming and Combinatorial Optimization, 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings. Lecture Notes in Computer Science 1084, Springer 1996, ISBN 3-540-61310-2
- 1995
- [j12]S. Thomas McCormick, Michael L. Pinedo: Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis. INFORMS Journal on Computing 7(1): 63-77 (1995)
- [c2]Alexander V. Karzanov, S. Thomas McCormick: Polynomial Methods for Separable Convex Optimization in Unimodular Spaces. SODA 1995: 78-87
- 1994
- [j11]S. Thomas McCormick, Thomas R. Ervolina: Computing Maximum Mean Cuts. Discrete Applied Mathematics 52(1): 53-70 (1994)
- 1993
- [j10]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)
- [j9]Thomas R. Ervolina, S. Thomas McCormick: Canceling most helpful total cuts for minimum cost network flow. Networks 23(1): 41-52 (1993)
- [j8]S. Thomas McCormick, S. Frank Chang: The Weighted Sparsity Problem: Complexity and Algorithms. SIAM J. Discrete Math. 6(1): 57-69 (1993)
- [j7]S. Frank Chang, S. Thomas McCormick: Implementation and computational results for the hierarchical algorithm for making sparse matrices sparser. ACM Trans. Math. Softw. 19(3): 419-441 (1993)
- [c1]S. Thomas McCormick, Thomas R. Ervolina: Canceling most helpful total submodular cuts for submodular flow. IPCO 1993: 343-353
- 1992
- [j6]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)
- [j5]S. Frank Chang, S. Thomas McCormick: A hierarchical algorithm for making sparse matrices sparser. Math. Program. 56: 1-30 (1992)
- [j4]Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi: Finding disjoint paths with different path-costs: Complexity and algorithms. Networks 22(7): 653-667 (1992)
- 1991
- [j3]S. Thomas McCormick: Making sparse matrices sparser: Computational results. Math. Program. 49: 91-111 (1991)
- 1990
- [j2]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)
1980 – 1989
- 1987
- [j1]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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-15 21:41 CET by the dblp team