The following pages link to S. Thomas McCormick (Q170012):
Displaying 50 items.
- A fast cost scaling algorithm for submodular flow (Q294751) (← links)
- The complexity of finding two disjoint paths with min-max objective function (Q584275) (← links)
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
- Structural and algorithmic properties for parametric minimum cuts (Q715078) (← links)
- Making sparse matrices sparser: Computational results (Q751503) (← links)
- Integral infeasibility and testing total dual integrality (Q757248) (← links)
- Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization (Q847846) (← links)
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs (Q896272) (← links)
- Conditional covering: greedy heuristics and computational results (Q1091265) (← links)
- The point-to-point delivery and connection problems: Complexity and algorithms (Q1193725) (← links)
- On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems (Q1196217) (← links)
- A hierarchical algorithm for making sparse matrices sparser (Q1207308) (← links)
- A fast bipartite network flow algorithm for selective assembly (Q1273091) (← links)
- Approximate binary search algorithms for mean cuts and cycles (Q1319679) (← links)
- Computing maximum mean cuts (Q1329796) (← links)
- How to compute least infeasible flows (Q1373747) (← links)
- A faster capacity scaling algorithm for minimum cost submodular flow (Q1600097) (← links)
- Matroid optimisation problems with nested non-linear monomials in the objective function (Q1646569) (← links)
- Protection of flows under targeted attacks (Q1727948) (← links)
- (Q1882112) (redirect page) (← links)
- Fast cycle canceling algorithms for minimum cost submodular flow (Q1882113) (← links)
- Matroid optimization problems with monotone monomials in the objective (Q2064281) (← links)
- Primal-dual algorithms for precedence constrained covering problems (Q2408089) (← links)
- Submodular containment is hard, even for networks (Q2564307) (← links)
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut (Q2583145) (← links)
- Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation (Q2638376) (← links)
- Separation, dimension, and facet algorithms for node flow polyhedra (Q2638390) (← links)
- Complexity of source-sink monotone 2-parameter min cut (Q2670479) (← links)
- Relaxed most negative cycle and most positive cut canceling algorithms for minimum cost flow (Q2757624) (← links)
- A polynomial algorithm for multiprocessor scheduling with two job lengths. (Q2757667) (← links)
- A Primal-Dual Algorithm for Weighted Abstract Cut Packing (Q3009773) (← links)
- Sequencing in an Assembly Line with Blocking to Minimize Cycle Time (Q3032070) (← links)
- (Q3109935) (← links)
- Primal-Dual Algorithms for Precedence Constrained Covering Problems (Q3453300) (← links)
- A Polynomial Algorithm for Weighted Abstract Flow (Q3503842) (← links)
- (Q3579438) (← links)
- (Q3683420) (← links)
- Finding disjoint paths with different path-costs: Complexity and algorithms (Q4022731) (← links)
- (Q4228485) (← links)
- (Q4234154) (← links)
- (Q4250177) (← links)
- (Q4263717) (← links)
- (Q4283444) (← links)
- Implementation and computational results for the hierarchical algorithm for making sparse matrices sparser (Q4371540) (← links)
- Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications (Q4376170) (← links)
- On Integral Policies in Deterministic and Stochastic Distribution Systems (Q4604904) (← links)
- Optimal approximation of sparse hessians and its equivalence to a graph coloring problem (Q4745216) (← links)
- Scheduling <i>n</i> Independent Jobs on <i>m</i> Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis (Q4835449) (← links)
- (Q4875223) (← links)
- (Q4886036) (← links)
