S. Thomas McCormick
Orcid: 0000-0002-2828-4100
According to our database1,
S. Thomas McCormick
authored at least 63 papers
between 1983 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
2022
Discret. Appl. Math., 2022
2021
A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices.
SIAM J. Discret. Math., 2021
Oper. Res., 2021
2020
Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts.
Proceedings of the Integer Programming and Combinatorial Optimization, 2020
2019
Technical Note - Error Noted in "Order-Based Cost Optimization in Assemble-to-Order Systems" by Lu and Song (2005).
Oper. Res., 2019
2018
Matroid optimisation problems with nested non-linear monomials in the objective function.
Math. Program., 2018
2017
Oper. Res., 2017
Algorithmica, 2017
2015
Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs.
Math. Program., 2015
2014
Decis. Sci., 2014
Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014
Proceedings of the Integer Programming and Combinatorial Optimization, 2014
2012
Math. Program., 2012
2011
Manuf. Serv. Oper. Manag., 2011
Proceedings of the Integer Programming and Combinatoral Optimization, 2011
2010
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization.
Math. Program., 2010
Math. Program., 2010
Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation.
Math. Program., 2010
2008
Proceedings of the Integer Programming and Combinatorial Optimization, 2008
2006
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut.
Math. Program., 2006
2005
SIAM J. Discret. Math., 2005
2003
2002
Math. Program., 2002
2001
Math. Oper. Res., 2001
2000
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks.
Oper. Res. Lett., 2000
Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow.
Math. Oper. Res., 2000
1999
Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow.
Oper. Res., 1999
Proceedings of the Integer Programming and Combinatorial Optimization, 1999
1998
Oper. Res. Lett., 1998
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998
1997
Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications.
SIAM J. Comput., 1997
Polynomial Algorithms for Multiprocessor Scheduling with a Small Number of Job Lengths.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997
1996
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996
1995
Scheduling <i>n</i> Independent Jobs on <i>m</i> Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis.
INFORMS J. Comput., 1995
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995
1994
1993
Implementation and computational results for the hierarchical algorithm for making sparse matrices sparser.
ACM Trans. Math. Softw., 1993
SIAM J. Discret. Math., 1993
Oper. Res. Lett., 1993
Discret. Appl. Math., 1993
Canceling most helpful total submodular cuts for submodular flow.
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993
1992
On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems.
Oper. Res. Lett., 1992
Networks, 1992
Discret. Appl. Math., 1992
1991
An Experimental Implementation of the Dual Cancel and Tighten Algorithm for Minimum-Cost Network Flow.
Proceedings of the Network Flows And Matching, 1991
1990
Discret. Appl. Math., 1990
1989
Oper. Res., 1989
1987
Comput. Oper. Res., 1987
1983
Optimal approximation of sparse hessians and its equivalence to a graph coloring problem.
Math. Program., 1983