S. Thomas McCormick

发表

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.

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.

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

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

Easy and difficult objective functions for max cut

Giovanni Rinaldi, S. Thomas McCormick, M. R. Rao, 2003, Math. Program..

A Primal-Dual Algorithm for Weighted Abstract Cut Packing

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

On Integral Policies in Deterministic and Stochastic Distribution Systems

Milind Dawande, Yang Bo, S. Thomas McCormick, 2017, Oper. Res..

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.

Computing Maximum Mean Cuts

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

Rerouting Flows when Links Fail

S. Thomas McCormick, Gianpaolo Oriolo, Jannik Matuschke, 2020, SIAM J. Discret. Math..

Polynomial methods for separable convex optimization in unimodular spaces

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

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

S. Thomas McCormick, Jing Shao, Harish Krishnan, 2014, Decis. Sci..

A hierarchical algorithm for making sparse matrices sparser

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

Transient behavior in a flexible assembly system

Michael Pinedo, S. Thomas McCormick, Scott Shenker, 1991 .

Incentives for Transshipment in a Supply Chain with Decentralized Retailers

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

Conditional covering: Greedy heuristics and computational results

S. Thomas McCormick, I. Douglas Moon, Sohail S. Chaudhry, 1987, Comput. Oper. Res..

The Weighted Sparsity Problem: Complexity and Algorithms

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

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

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

Submodular Function Minimization

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

Separation, dimension, and facet algorithms for node flow polyhedra

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

A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths

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

A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts

Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne, 2014, IPCO.

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

S. Thomas McCormick, Frank Vallentin, Britta Peis, 2020, SIAM Journal on Discrete Mathematics.

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.

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

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

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

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

Li Liu, S. Thomas McCormick, 1991, Network Flows And Matching.

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

Integral infeasibility and testing total dual integrality

William J. Cook, S. Thomas McCormick, David L. Applegate, 1991, Oper. Res. Lett..

Primal-Dual Algorithms for Precedence Constrained Covering Problems

S. Thomas McCormick, Britta Peis, Andreas Wierz, 2014, WAOA.

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

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

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

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

Sequencing in an Assembly Line with Blocking to Minimize Cycle Time

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

A fast bipartite network flow algorithm for selective assembly

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

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

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

Approximate binary search algorithms for mean cuts and cycles

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

A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem

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

Making sparse matrices sparser: Computational results

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

A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow

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

Technical Note - Error Noted in "Order-Based Cost Optimization in Assemble-to-Order Systems" by Lu and Song (2005)

S. Thomas McCormick, Kazuo Murota, Woonghee Tim Huh, 2019, Oper. Res..

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization

S. Thomas McCormick, Maurice Queyranne, William H. Cunningham, 1996 .

A polynomial algorithm for abstract maximum flow

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

Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization

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

Integer Programming and Combinatorial Optimization

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

Protection of flows under targeted attacks pdf

Martin Skutella, S. Thomas McCormick, Gianpaolo Oriolo, 2017, Oper. Res. Lett..

A Polynomial Algorithm for Weighted Abstract Flow

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

A Fluid Model for an Overloaded Bipartite Queueing System with Heterogeneous Matching Utility

S. Thomas McCormick, Mahesh Nagarajan, Yichuan Ding, 2018 .

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

S. Thomas McCormick, 1999, Oper. Res..

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

How to compute least infeasible flows

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

Submodular containment is hard, even for networks

S. Thomas McCormick, S. T. McCormick, 1996, Oper. Res. Lett..

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

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

Rerouting Flows When Links Fail

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

Primal–Dual Algorithms for Precedence Constrained Covering Problems

S. Thomas McCormick, José Verschae, Britta Peis, 2016, Algorithmica.

The consumer response to photovoltaics: the MIT Sun Day experience

S. Thomas McCormick, Gary Louis Lilien, 1979 .

Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis

Michael Pinedo, S. Thomas McCormick, 1995, INFORMS J. Comput..

A fast cost scaling algorithm for submodular flow

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

Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*

Satoru Iwata, S. Thomas McCormick, Maiko Shigeno, 2003, Comb..

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

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

A Special Issue in Memory of George B. Dantzig

Egon Balas, S. Thomas McCormick, Alan J. Hoffman, 2008, Discret. Optim..

Canceling most helpful total cuts for minimum cost network flow

S. Thomas McCormick, Thomas R. Ervolina, S. T. McCormick, 1993, Networks.

Two Strongly Polynomial Cut Cancelling Algorithms for Minimum Cost Network Flow

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

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

Structural and algorithmic properties for parametric minimum cuts

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

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.

Complexity of Source-Sink Monotone 2-Parameter Min Cut pdf

S. Thomas McCormick, Venus Lo, Maxwell Allman, 2021, Operations Research Letters.

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

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

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

Integer programming and combinatorial optimization : 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996 : proceedings

S. Thomas McCormick, Maurice Queyranne, William H. Cunningham, 1996 .

Gray Markets and Supply Chain Incentives

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

Matroid optimization problems with monotone monomials in the objective

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

When is min cut with negative edges easy to solve? Easy and difficult objective functions for max cut

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