S. McCormick

发表

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

F. Fischer, A. Fischer, S. McCormick, 2017, Mathematical Programming.

Structural and algorithmic properties for parametric minimum cuts

F. Tardella, F. Granot, M. Queyranne, 2011, Mathematical Programming.

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

M. Queyranne, A. Mahjoub, H. Aissi, 2015, Mathematical Programming.

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

Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi, 1989, Discret. Appl. Math..

A Fast Algorithm that makes Matrices Optimally Sparse

A. Hoffman, S. T. McCormick, S. McCormick, 1984 .

Canceling most helpful total submodular cuts for submodular flow

S. Thomas McCormick, Thomas R. Ervolina, T. Ervolina, 1993, Conference on Integer Programming and Combinatorial Optimization.

Separation, dimension, and facet algorithms for node flow polyhedra

S. Thomas McCormick, Maurice Queyranne, Maren Martens, 2010, Math. Program..

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

Satoru Iwata, S. Thomas McCormick, Maiko Shigeno, 2000, Math. Oper. Res..

Computing Maximum Mean Cuts

S. Thomas McCormick, Thomas R. Ervolina, T. Ervolina, 1994, Discret. Appl. Math..

Approximate binary search algorithms for mean cuts and cycles

S. Thomas McCormick, S. McCormick, 1993, Oper. Res. Lett..

Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications

S. Thomas McCormick, Alexander V. Karzanov, A. Karzanov, 1997, SIAM J. Comput..

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

S. Thomas McCormick, S. Frank Chang, S. McCormick, 1993, TOMS.

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

Ali Ridha Mahjoub, S. Thomas McCormick, A. Mahjoub, 2010, Math. Program..

A faster capacity scaling algorithm for minimum cost submodular flow

Satoru Iwata, S. Thomas McCormick, Lisa Fleischer, 2002, Math. Program..

Gray Markets and Supply Chain Incentives

S. Thomas McCormick, Harish Krishnan, H. Krishnan, 2016 .

A hierarchical algorithm for making sparse matrices sparser

S. Thomas McCormick, S. Frank Chang, S. T. McCormick, 1992, Math. Program..

A polynomial time algorithm for solving the closest vector problem in zonotopal lattices pdf

S. Thomas McCormick, Frank Vallentin, Britta Peis, 2020, SIAM J. Discret. Math..

Integer Programming and Combinatorial Optimization

S. Thomas McCormick, Maurice Queyranne, William H. Cunningham, 1996, Lecture Notes in Computer Science.

Making sparse matrices sparser: Computational results

S. Thomas McCormick, S. McCormick, 1990, Math. Program..

Rerouting Flows When Links Fail

S. Thomas McCormick, Gianpaolo Oriolo, Jannik Matuschke, 2017, ICALP.

Distributing a Product Line in a Decentralized Supply Chain

S. T. McCormick, H. Krishnan, Jing Shao, 2013 .

Incentives for Transshipment in a Supply Chain with Decentralized Retailers

S. Thomas McCormick, Jing Shao, Harish Krishnan, 2011, Manuf. Serv. Oper. Manag..

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

Ali Ridha Mahjoub, S. Thomas McCormick, Bernard Fortz, 2006, Math. Program..

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

S. Thomas McCormick, S. T. McCormick, S. McCormick, 1983, Math. Program..

A combinatorial approach to some sparse matrix problems

S. T. McCormick, S. McCormick, 1983 .

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

Laura Vargas Koch, Britta Peis, S. McCormick, 2023, ArXiv.

On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems

Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi, 1992, Oper. Res. Lett..

Two Strongly Polynomial Cut Cancelling Algorithms for Minimum Cost Network Flow

S. Thomas McCormick, Thomas R. Ervolina, S. T. McCormick, 1993, Discret. Appl. Math..

Locating independent facilities with maximum weight: Greedy heuristics

S. T. McCormick, I. Moon, S. Chaudhry, 1986 .

Matroid optimization problems with monotone monomials in the objective

S. Thomas McCormick, Anja Fischer, Frank Fischer, 2020 .

Sequencing in an Assembly Line with Blocking to Minimize Cycle Time

Michael Pinedo, S. Thomas McCormick, Scott Shenker, 1989, Oper. Res..

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

S. Thomas McCormick, Mahesh Nagarajan, Yichuan Ding, 2021, Oper. Res..

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

Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi, 1992, Discret. Appl. Math..

A Primal-Dual Algorithm for Weighted Abstract Cut Packing

S. Thomas McCormick, Britta Peis, Britta Peis, 2011, IPCO.

The Weighted Sparsity Problem: Complexity and Algorithms

S. Thomas McCormick, S. Frank Chang, S. McCormick, 1993, SIAM J. Discret. Math..

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

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

Structural and algorithmic properties for parametric minimum cuts

Fabio Tardella, S. Thomas McCormick, Maurice Queyranne, 2012, Math. Program..

Submodular Function Minimization

S. Thomas McCormick, S. T. McCormick, S. McCormick, 2005 .

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

S. Thomas McCormick, Anja Fischer, Frank Fischer, 2018, Math. Program..

A Polynomial Algorithm for Weighted Abstract Flow

S. Thomas McCormick, Maren Martens, M. Martens, 2008, IPCO.

Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization

S. Thomas McCormick, Satoru Fujishige, S. Fujishige, 2008, SODA '08.

A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem

Satoru Iwata, S. Thomas McCormick, Maiko Shigeno, 1999, IPCO.

Easy and difficult objective functions for max cut

G. Rinaldi, M. Rao, S. McCormick, 2003, Math. Program..

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

Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne, 2015, Mathematical Programming.

A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths

Frits C. R. Spieksma, S. Thomas McCormick, Scott R. Smallwood, 2001, Math. Oper. Res..

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

S. Thomas McCormick, Akiyoshi Shioura, A. Shioura, 2000, SODA '00.

Polynomial algorithms for multiprocessor scheduling with a small number of job lengths

Frits C. R. Spieksma, S. Thomas McCormick, Scott R. Smallwood, 1997, SODA '97.

A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow

Satoru Iwata, S. Thomas McCormick, Maiko Shigeno, 2005, SIAM J. Discret. Math..

Fast algorithms for parametric scheduling come from extensions to parametric maximum flow

S. Thomas McCormick, W. Orlikowski, J. Yates, 1996, STOC '96.

A faster algorithm for minimum cost submodular flows

Satoru Iwata, S. Thomas McCormick, Maiko Shigeno, 1998, SODA '98.

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

S. Thomas McCormick, Maurice Queyranne, Hassene Aissi, 2020, IPCO.

Faster Algorithms for Parametric Global Minimum Cut Problems

M. Queyranne, S. McCormick, Hassene Aissi, 2019, ArXiv.

A fast cost scaling algorithm for submodular flow

Satoru Iwata, S. Thomas McCormick, Maiko Shigeno, 2000, Inf. Process. Lett..

A polynomial algorithm for abstract maximum flow

S. Thomas McCormick, S. McCormick, 1996, SODA '96.

Polynomial methods for separable convex optimization in unimodular spaces

S. Thomas McCormick, Alexander V. Karzanov, A. Karzanov, 1995, SODA '95.

A fast bipartite network flow algorithm for selective assembly

Satoru Iwata, S. Thomas McCormick, Tomomi Matsui, 1998, Oper. Res. Lett..