The following pages link to S. Thomas McCormick (Q170012):
Displaying 17 items.
- Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow (Q4950820) (← links)
- (Q4952722) (← links)
- Technical Note—Error Noted in “Order-Based Cost Optimization in Assemble-to-Order Systems” by Lu and Song (2005) (Q4971584) (← links)
- A Fluid Model for One-Sided Bipartite Matching Queues with Match-Dependent Rewards (Q5031622) (← links)
- Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts (Q5041732) (← links)
- (Q5111420) (← links)
- Rerouting Flows when Links Fail (Q5128505) (← links)
- A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices (Q5163506) (← links)
- Canceling most helpful total cuts for minimum cost network flow (Q5285477) (← links)
- The Weighted Sparsity Problem: Complexity and Algorithms (Q5285937) (← links)
- (Q5292089) (← links)
- A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts (Q5418982) (← links)
- A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow (Q5470761) (← links)
- (Q5501829) (← links)
- Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks (Q5929137) (← links)
- Complexity of Source-Sink Monotone 2-Parameter Min Cut (Q6373334) (← links)
- A flow-based ascending auction to compute buyer-optimal Walrasian prices (Q6599058) (← links)
