S. Thomas McCormick

From MaRDI portal
Revision as of 10:24, 8 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page S. Thomas McCormick to S. Thomas McCormick: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:170012

Available identifiers

zbMath Open mccormick.s-thomasWikidataQ59752813 ScholiaQ59752813MaRDI QIDQ170012

List of research outcomes

PublicationDate of PublicationType
Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts2022-10-14Paper
Complexity of source-sink monotone 2-parameter min cut2022-03-11Paper
A Fluid Model for One-Sided Bipartite Matching Queues with Match-Dependent Rewards2022-02-16Paper
Matroid optimization problems with monotone monomials in the objective2022-01-05Paper
A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices2021-11-04Paper
Complexity of Source-Sink Monotone 2-Parameter Min Cut2021-07-20Paper
Rerouting Flows when Links Fail2020-10-27Paper
Technical Note—Error Noted in “Order-Based Cost Optimization in Assemble-to-Order Systems” by Lu and Song (2005)2020-10-12Paper
https://portal.mardi4nfdi.de/entity/Q51114202020-05-27Paper
A polynomial time algorithm for solving the closest vector problem in zonotopal lattices2020-04-16Paper
Protection of flows under targeted attacks2019-02-21Paper
Matroid optimisation problems with nested non-linear monomials in the objective function2018-06-25Paper
On Integral Policies in Deterministic and Stochastic Distribution Systems2018-03-06Paper
Primal-dual algorithms for precedence constrained covering problems2017-10-09Paper
A fast cost scaling algorithm for submodular flow2016-06-16Paper
Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs2015-12-09Paper
Primal-Dual Algorithms for Precedence Constrained Covering Problems2015-11-20Paper
https://portal.mardi4nfdi.de/entity/Q55018292015-08-14Paper
A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts2014-06-02Paper
Structural and algorithmic properties for parametric minimum cuts2012-10-15Paper
https://portal.mardi4nfdi.de/entity/Q31099352012-01-26Paper
A Primal-Dual Algorithm for Weighted Abstract Cut Packing2011-06-24Paper
Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation2010-09-16Paper
Separation, dimension, and facet algorithms for node flow polyhedra2010-09-16Paper
https://portal.mardi4nfdi.de/entity/Q35794382010-08-06Paper
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization2010-02-19Paper
A Polynomial Algorithm for Weighted Abstract Flow2008-06-10Paper
https://portal.mardi4nfdi.de/entity/Q52920892007-06-19Paper
A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow2006-06-01Paper
Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut2006-01-13Paper
Fast cycle canceling algorithms for minimum cost submodular flow2004-10-19Paper
A faster capacity scaling algorithm for minimum cost submodular flow2002-01-01Paper
Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow2001-11-26Paper
A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths2001-11-26Paper
https://portal.mardi4nfdi.de/entity/Q49527222001-02-08Paper
Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks2001-01-01Paper
Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow2000-04-27Paper
https://portal.mardi4nfdi.de/entity/Q42341541999-11-14Paper
https://portal.mardi4nfdi.de/entity/Q42637171999-09-22Paper
https://portal.mardi4nfdi.de/entity/Q42501771999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q42284851999-03-01Paper
A fast bipartite network flow algorithm for selective assembly1998-12-06Paper
Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications1998-02-10Paper
Implementation and computational results for the hierarchical algorithm for making sparse matrices sparser1998-01-26Paper
How to compute least infeasible flows1997-11-25Paper
Submodular containment is hard, even for networks1997-07-14Paper
https://portal.mardi4nfdi.de/entity/Q48752231996-09-15Paper
https://portal.mardi4nfdi.de/entity/Q48860361996-07-28Paper
Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis1995-10-09Paper
Approximate binary search algorithms for mean cuts and cycles1994-12-18Paper
Computing maximum mean cuts1994-07-31Paper
https://portal.mardi4nfdi.de/entity/Q42834441994-05-26Paper
Two strongly polynomial cut cancelling algorithms for minimum cost network flow1994-01-02Paper
Canceling most helpful total cuts for minimum cost network flow1993-06-29Paper
The Weighted Sparsity Problem: Complexity and Algorithms1993-06-29Paper
A hierarchical algorithm for making sparse matrices sparser1993-04-01Paper
Finding disjoint paths with different path-costs: Complexity and algorithms1993-01-17Paper
On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems1992-12-17Paper
The point-to-point delivery and connection problems: Complexity and algorithms1992-09-27Paper
Integral infeasibility and testing total dual integrality1991-01-01Paper
The complexity of finding two disjoint paths with min-max objective function1990-01-01Paper
Making sparse matrices sparser: Computational results1990-01-01Paper
Sequencing in an Assembly Line with Blocking to Minimize Cycle Time1989-01-01Paper
Conditional covering: greedy heuristics and computational results1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36834201984-01-01Paper
Optimal approximation of sparse hessians and its equivalence to a graph coloring problem1983-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: S. Thomas McCormick