S. Thomas McCormick

According to our database, S. Thomas McCormick authored at least 63 papers between 1983 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

A flow-based ascending auction to compute buyer-optimal Walrasian prices.

Katharina Eickhoff, S. Thomas McCormick, Britta Peis, Niklas Rieken, Laura Vargas Koch

CoRR, 2023

2022

Complexity of Source-Sink Monotone 2-parameter min cut.

Maxwell Allman, Venus Lo, S. Thomas McCormick

Oper. Res. Lett., 2022

Matroid optimization problems with monotone monomials in the objective.

Anja Fischer, Frank Fischer, S. Thomas McCormick

Discret. Appl. Math., 2022

2021

A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices.

S. Thomas McCormick, Britta Peis, Robert Scheidweiler, Frank Vallentin

SIAM J. Discret. Math., 2021

A Fluid Model for One-Sided Bipartite Matching Queues with Match-Dependent Rewards.

Yichuan Ding, S. Thomas McCormick, Mahesh Nagarajan

Oper. Res., 2021

2020

Rerouting Flows when Links Fail.

Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo

SIAM J. Discret. Math., 2020

Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts.

Hassene Aissi, S. Thomas McCormick, Maurice Queyranne

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).

Mohammadreza Bolandnazar, Woonghee Tim Huh, S. Thomas McCormick, Kazuo Murota

Oper. Res., 2019

Faster Algorithms for Parametric Global Minimum Cut Problems.

Hassene Aissi, S. Thomas McCormick, Maurice Queyranne

CoRR, 2019

2018

Matroid optimisation problems with nested non-linear monomials in the objective function.

Anja Fischer, Frank Fischer, S. Thomas McCormick

Math. Program., 2018

2017

Protection of flows under targeted attacks.

Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo, Britta Peis, Martin Skutella

Oper. Res. Lett., 2017

On Integral Policies in Deterministic and Stochastic Distribution Systems.

Yang Bo, Milind Dawande, Ganesh Janakiraman, S. Thomas McCormick

Oper. Res., 2017

Primal-Dual Algorithms for Precedence Constrained Covering Problems.

S. Thomas McCormick, Britta Peis, José Verschae, Andreas Wierz

Algorithmica, 2017

2015

Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs.

Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne

Math. Program., 2015

2014

Price Incentives and Coordination in a Two-Product Decentralized Supply Chain.

Jing Shao, Harish Krishnan, S. Thomas McCormick

Decis. Sci., 2014

Primal-Dual Algorithms for Precedence Constrained Covering Problems.

Andreas Wierz, Britta Peis, S. Thomas McCormick

Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts.

Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne

Proceedings of the Integer Programming and Combinatorial Optimization, 2014

2012

Structural and algorithmic properties for parametric minimum cuts.

Frieda Granot, S. Thomas McCormick, Maurice Queyranne, Fabio Tardella

Math. Program., 2012

2011

Incentives for Transshipment in a Supply Chain with Decentralized Retailers.

Jing Shao, Harish Krishnan, S. Thomas McCormick

Manuf. Serv. Oper. Manag., 2011

A Primal-Dual Algorithm for Weighted Abstract Cut Packing.

S. Thomas McCormick, Britta Peis

Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2010

Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization.

S. Thomas McCormick, Satoru Fujishige

Math. Program., 2010

Separation, dimension, and facet algorithms for node flow polyhedra.

Maren Martens, S. Thomas McCormick, Maurice Queyranne

Math. Program., 2010

Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation.

Ali Ridha Mahjoub, S. Thomas McCormick

Math. Program., 2010

2008

A Special Issue in Memory of George B. Dantzig.

Egon Balas, Alan J. Hoffman, S. Thomas McCormick

Discret. Optim., 2008

A Polynomial Algorithm for Weighted Abstract Flow.

Maren Martens, S. Thomas McCormick

Proceedings of the Integer Programming and Combinatorial Optimization, 2008

2006

Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut.

Bernard Fortz, Ali Ridha Mahjoub, S. Thomas McCormick, Pierre Pesneau

Math. Program., 2006

2005

A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow.

Satoru Iwata, S. Thomas McCormick, Maiko Shigeno

SIAM J. Discret. Math., 2005

2003

Easy and difficult objective functions for max cut.

S. Thomas McCormick, M. R. Rao, Giovanni Rinaldi

Math. Program., 2003

Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*.

Satoru Iwata, S. Thomas McCormick, Maiko Shigeno

Comb., 2003

2002

A faster capacity scaling algorithm for minimum cost submodular flow.

Lisa Fleischer, Satoru Iwata, S. Thomas McCormick

Math. Program., 2002

2001

A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths.

S. Thomas McCormick, Scott R. Smallwood, Frits C. R. Spieksma

Math. Oper. Res., 2001

2000

Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks.

S. Thomas McCormick, Akiyoshi Shioura

Oper. Res. Lett., 2000

Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow.

Maiko Shigeno, Satoru Iwata, S. Thomas McCormick

Math. Oper. Res., 2000

A fast cost scaling algorithm for submodular flow.

Satoru Iwata, S. Thomas McCormick, Maiko Shigeno

Inf. Process. Lett., 2000

1999

Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow.

S. Thomas McCormick

Oper. Res., 1999

A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem.

Satoru Iwata, S. Thomas McCormick, Maiko Shigeno

Proceedings of the Integer Programming and Combinatorial Optimization, 1999

1998

A fast bipartite network flow algorithm for selective assembly.

Satoru Iwata, Tomomi Matsui, S. Thomas McCormick

Oper. Res. Lett., 1998

A Faster Algorithm for Minimum Cost Submodular Flows.

Satoru Iwata, S. Thomas McCormick, Maiko Shigeno

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.

Alexander V. Karzanov, S. Thomas McCormick

SIAM J. Comput., 1997

How to compute least infeasible flows.

S. Thomas McCormick

Math. Program., 1997

Polynomial Algorithms for Multiprocessor Scheduling with a Small Number of Job Lengths.

S. Thomas McCormick, Scott R. Smallwood, Frits C. R. Spieksma

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996

Submodular containment is hard, even for networks.

S. Thomas McCormick

Oper. Res. Lett., 1996

A Polynomial Algorithm for Abstract Maximum Flow.

S. Thomas McCormick

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.

S. Thomas McCormick, Michael L. Pinedo

INFORMS J. Comput., 1995

Polynomial Methods for Separable Convex Optimization in Unimodular Spaces.

Alexander V. Karzanov, S. Thomas McCormick

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

1994

Computing Maximum Mean Cuts.

S. Thomas McCormick, Thomas R. Ervolina

Discret. Appl. Math., 1994

1993

Implementation and computational results for the hierarchical algorithm for making sparse matrices sparser.

S. Frank Chang, S. Thomas McCormick

ACM Trans. Math. Softw., 1993

The Weighted Sparsity Problem: Complexity and Algorithms.

S. Thomas McCormick, S. Frank Chang

SIAM J. Discret. Math., 1993

Approximate binary search algorithms for mean cuts and cycles.

S. Thomas McCormick

Oper. Res. Lett., 1993

Canceling most helpful total cuts for minimum cost network flow.

Thomas R. Ervolina, S. Thomas McCormick

Networks, 1993

Two Strongly Polynomial Cut Cancelling Algorithms for Minimum Cost Network Flow.

Thomas R. Ervolina, S. Thomas McCormick

Discret. Appl. Math., 1993

Canceling most helpful total submodular cuts for submodular flow.

S. Thomas McCormick, Thomas R. Ervolina

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.

Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi

Oper. Res. Lett., 1992

Finding disjoint paths with different path-costs: Complexity and algorithms.

Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi

Networks, 1992

A hierarchical algorithm for making sparse matrices sparser.

S. Frank Chang, S. Thomas McCormick

Math. Program., 1992

The point-to-point delivery and connection problems: complexity and algorithms.

Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi

Discret. Appl. Math., 1992

1991

Integral infeasibility and testing total dual integrality.

David L. Applegate, William J. Cook, S. Thomas McCormick

Oper. Res. Lett., 1991

Making sparse matrices sparser: Computational results.

S. Thomas McCormick

Math. Program., 1991

An Experimental Implementation of the Dual Cancel and Tighten Algorithm for Minimum-Cost Network Flow.

S. Thomas McCormick, Li Liu

Proceedings of the Network Flows And Matching, 1991

1990

The complexity of finding two disjoint paths with min-max objective function.

Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi

Discret. Appl. Math., 1990

1989

Sequencing in an Assembly Line with Blocking to Minimize Cycle Time.

S. Thomas McCormick, Michael L. Pinedo, Scott Shenker, Barry Wolf

Oper. Res., 1989

1987

Conditional covering: Greedy heuristics and computational results.

Sohail S. Chaudhry, I. Douglas Moon, S. Thomas McCormick

Comput. Oper. Res., 1987

1983

Optimal approximation of sparse hessians and its equivalence to a graph coloring problem.

S. Thomas McCormick

Math. Program., 1983