S. Thomas McCormick

Publication Activity (10 Years)

Years Active: 1983-2023
Publications (10 Years): 18

Top Topics

Optimisation Problems

Strongly Polynomial

Top Venues

Oper. Res. Lett.

Publications

Katharina Eickhoff, S. Thomas McCormick, Britta Peis, Niklas Rieken, Laura Vargas Koch
A flow-based ascending auction to compute buyer-optimal Walrasian prices. CoRR (2023)
Maxwell Allman, Venus Lo, S. Thomas McCormick
Complexity of Source-Sink Monotone 2-parameter min cut. Oper. Res. Lett. 50 (1) (2022)
Anja Fischer, Frank Fischer, S. Thomas McCormick
Matroid optimization problems with monotone monomials in the objective. Discret. Appl. Math. 308 (2022)
Maxwell Allman, Venus Lo, S. Thomas McCormick
Complexity of Source-Sink Monotone 2-Parameter Min Cut. CoRR (2021)
Yichuan Ding, S. Thomas McCormick, Mahesh Nagarajan
A Fluid Model for One-Sided Bipartite Matching Queues with Match-Dependent Rewards. Oper. Res. 69 (4) (2021)
S. Thomas McCormick, Britta Peis, Robert Scheidweiler, Frank Vallentin
A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices. SIAM J. Discret. Math. 35 (4) (2021)
S. Thomas McCormick, Britta Peis, Robert Scheidweiler, Frank Vallentin
A polynomial time algorithm for solving the closest vector problem in zonotopal lattices. CoRR (2020)
Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo
Rerouting Flows when Links Fail. SIAM J. Discret. Math. 34 (4) (2020)
Hassene Aissi, S. Thomas McCormick, Maurice Queyranne
Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts. IPCO (2020)
Mohammadreza Bolandnazar, Woonghee Tim Huh, S. Thomas McCormick, Kazuo Murota
Technical Note - Error Noted in "Order-Based Cost Optimization in Assemble-to-Order Systems" by Lu and Song (2005). Oper. Res. 67 (1) (2019)
Hassene Aissi, S. Thomas McCormick, Maurice Queyranne
Faster Algorithms for Parametric Global Minimum Cut Problems. CoRR (2019)
Anja Fischer, Frank Fischer, S. Thomas McCormick
Matroid optimisation problems with nested non-linear monomials in the objective function. Math. Program. 169 (2) (2018)
S. Thomas McCormick, Britta Peis, José Verschae, Andreas Wierz
Primal-Dual Algorithms for Precedence Constrained Covering Problems. Algorithmica 78 (3) (2017)
Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo, Britta Peis, Martin Skutella
Protection of flows under targeted attacks. Oper. Res. Lett. 45 (1) (2017)
Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo
Rerouting flows when links fail. CoRR (2017)
Yang Bo, Milind Dawande, Ganesh Janakiraman, S. Thomas McCormick
On Integral Policies in Deterministic and Stochastic Distribution Systems. Oper. Res. 65 (3) (2017)
Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo
Rerouting Flows When Links Fail. ICALP (2017)
Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo, Britta Peis, Martin Skutella
Protection of flows under targeted attacks. CoRR (2016)
Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne
Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs. Math. Program. 154 (1-2) (2015)
Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne
A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts. IPCO (2014)
Jing Shao, Harish Krishnan, S. Thomas McCormick
Price Incentives and Coordination in a Two-Product Decentralized Supply Chain. Decis. Sci. 45 (3) (2014)
Andreas Wierz, Britta Peis, S. Thomas McCormick
Primal-Dual Algorithms for Precedence Constrained Covering Problems. WAOA (2014)
Frieda Granot, S. Thomas McCormick, Maurice Queyranne, Fabio Tardella
Structural and algorithmic properties for parametric minimum cuts. Math. Program. 135 (1-2) (2012)
Jing Shao, Harish Krishnan, S. Thomas McCormick
Incentives for Transshipment in a Supply Chain with Decentralized Retailers. Manuf. Serv. Oper. Manag. 13 (3) (2011)
S. Thomas McCormick, Britta Peis
A Primal-Dual Algorithm for Weighted Abstract Cut Packing. IPCO (2011)
S. Thomas McCormick, Satoru Fujishige
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization. Math. Program. 122 (1) (2010)
Maren Martens, S. Thomas McCormick, Maurice Queyranne
Separation, dimension, and facet algorithms for node flow polyhedra. Math. Program. 124 (1-2) (2010)
Ali Ridha Mahjoub, S. Thomas McCormick
Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation. Math. Program. 124 (1-2) (2010)
S. Thomas McCormick, Satoru Fujishige
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization. SODA (2008)
Egon Balas, Alan J. Hoffman, S. Thomas McCormick
A Special Issue in Memory of George B. Dantzig. Discret. Optim. 5 (2) (2008)
Maren Martens, S. Thomas McCormick
A Polynomial Algorithm for Weighted Abstract Flow. IPCO (2008)
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) (2006)
Satoru Iwata, S. Thomas McCormick, Maiko Shigeno
A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow. SIAM J. Discret. Math. 19 (2) (2005)
S. Thomas McCormick, M. R. Rao, Giovanni Rinaldi
Easy and difficult objective functions for max cut. Math. Program. 94 (2-3) (2003)
Satoru Iwata, S. Thomas McCormick, Maiko Shigeno
Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*. Comb. 23 (3) (2003)
Lisa Fleischer, Satoru Iwata, S. Thomas McCormick
A faster capacity scaling algorithm for minimum cost submodular flow. Math. Program. 92 (1) (2002)
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) (2001)
S. Thomas McCormick, Akiyoshi Shioura
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks. SODA (2000)
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) (2000)
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) (2000)
Satoru Iwata, S. Thomas McCormick, Maiko Shigeno
A fast cost scaling algorithm for submodular flow. Inf. Process. Lett. 74 (3-4) (2000)
S. Thomas McCormick
Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow. Oper. Res. 47 (5) (1999)
Satoru Iwata, S. Thomas McCormick, Maiko Shigeno
A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem. IPCO (1999)
Satoru Iwata, Tomomi Matsui, S. Thomas McCormick
A fast bipartite network flow algorithm for selective assembly. Oper. Res. Lett. 22 (4-5) (1998)
Satoru Iwata, S. Thomas McCormick, Maiko Shigeno
A Faster Algorithm for Minimum Cost Submodular Flows. SODA (1998)
S. Thomas McCormick, Scott R. Smallwood, Frits C. R. Spieksma
Polynomial Algorithms for Multiprocessor Scheduling with a Small Number of Job Lengths. SODA (1997)
S. Thomas McCormick
How to compute least infeasible flows. Math. Program. 77 (1997)
Alexander V. Karzanov, S. Thomas McCormick
Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications. SIAM J. Comput. 26 (4) (1997)
S. Thomas McCormick
Submodular containment is hard, even for networks. Oper. Res. Lett. 19 (2) (1996)
S. Thomas McCormick
A Polynomial Algorithm for Abstract Maximum Flow. SODA (1996)
S. Thomas McCormick
Fast Algorithms for Parametric Scheduling Come from Extensions to Parametric Maximum Flow. STOC (1996)
S. Thomas McCormick, Michael L. Pinedo
Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis. INFORMS J. Comput. 7 (1) (1995)
Alexander V. Karzanov, S. Thomas McCormick
Polynomial Methods for Separable Convex Optimization in Unimodular Spaces. SODA (1995)
S. Thomas McCormick, Thomas R. Ervolina
Computing Maximum Mean Cuts. Discret. Appl. Math. 52 (1) (1994)
Thomas R. Ervolina, S. Thomas McCormick
Two Strongly Polynomial Cut Cancelling Algorithms for Minimum Cost Network Flow. Discret. Appl. Math. 46 (2) (1993)
S. Thomas McCormick, S. Frank Chang
The Weighted Sparsity Problem: Complexity and Algorithms. SIAM J. Discret. Math. 6 (1) (1993)
S. Thomas McCormick
Approximate binary search algorithms for mean cuts and cycles. Oper. Res. Lett. 14 (3) (1993)
Thomas R. Ervolina, S. Thomas McCormick
Canceling most helpful total cuts for minimum cost network flow. Networks 23 (1) (1993)
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) (1993)
S. Thomas McCormick, Thomas R. Ervolina
Canceling most helpful total submodular cuts for submodular flow. IPCO (1993)
Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi
The point-to-point delivery and connection problems: complexity and algorithms. Discret. Appl. Math. 36 (3) (1992)
Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi
Finding disjoint paths with different path-costs: Complexity and algorithms. Networks 22 (7) (1992)
Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi
On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems. Oper. Res. Lett. 11 (5) (1992)
S. Frank Chang, S. Thomas McCormick
A hierarchical algorithm for making sparse matrices sparser. Math. Program. 56 (1992)
David L. Applegate, William J. Cook, S. Thomas McCormick
Integral infeasibility and testing total dual integrality. Oper. Res. Lett. 10 (1) (1991)
S. Thomas McCormick
Making sparse matrices sparser: Computational results. Math. Program. 49 (1991)
S. Thomas McCormick, Li Liu
An Experimental Implementation of the Dual Cancel and Tighten Algorithm for Minimum-Cost Network Flow. Network Flows And Matching (1991)
Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi
The complexity of finding two disjoint paths with min-max objective function. Discret. Appl. Math. 26 (1) (1990)
S. Thomas McCormick, Michael L. Pinedo, Scott Shenker, Barry Wolf
Sequencing in an Assembly Line with Blocking to Minimize Cycle Time. Oper. Res. 37 (6) (1989)
Sohail S. Chaudhry, I. Douglas Moon, S. Thomas McCormick
Conditional covering: Greedy heuristics and computational results. Comput. Oper. Res. 14 (1) (1987)
S. Thomas McCormick
Optimal approximation of sparse hessians and its equivalence to a graph coloring problem. Math. Program. 26 (2) (1983)