S. Thomas McCormick

73 papers A* 8B 8Journal 56Unranked 1

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	A flow-based ascending auction to compute buyer-optimal Walrasian prices. Networks Katharina Eickhoff, S. Thomas McCormick, Britta Peis, Niklas Rieken, Laura Vargas Koch
2023	J	`jnl`	A flow-based ascending auction to compute buyer-optimal Walrasian prices. CoRR Katharina Eickhoff, S. Thomas McCormick, Britta Peis, Niklas Rieken, Laura Vargas Koch
2022	J	`jnl`	Complexity of Source-Sink Monotone 2-parameter min cut. Oper. Res. Lett. Maxwell Allman, Venus Lo, S. Thomas McCormick
2022	J	`jnl`	Matroid optimization problems with monotone monomials in the objective. Discret. Appl. Math. Anja Fischer, Frank Fischer, S. Thomas McCormick
2021	J	`jnl`	A Fluid Model for One-Sided Bipartite Matching Queues with Match-Dependent Rewards. Oper. Res. Yichuan Ding, S. Thomas McCormick, Mahesh Nagarajan
2021	J	`jnl`	A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices. SIAM J. Discret. Math. S. Thomas McCormick, Britta Peis, Robert Scheidweiler, Frank Vallentin
2021	J	`jnl`	Complexity of Source-Sink Monotone 2-Parameter Min Cut. CoRR Maxwell Allman, Venus Lo, S. Thomas McCormick
2020	J	`jnl`	A polynomial time algorithm for solving the closest vector problem in zonotopal lattices. CoRR S. Thomas McCormick, Britta Peis, Robert Scheidweiler, Frank Vallentin
2020	B	`conf`	Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts. IPCO Hassene Aissi, S. Thomas McCormick, Maurice Queyranne
2020	J	`jnl`	Rerouting Flows when Links Fail. SIAM J. Discret. Math. Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo
2019	J	`jnl`	Faster Algorithms for Parametric Global Minimum Cut Problems. CoRR Hassene Aissi, S. Thomas McCormick, Maurice Queyranne
2019	J	`jnl`	Technical Note - Error Noted in "Order-Based Cost Optimization in Assemble-to-Order Systems" by Lu and Song (2005). Oper. Res. Mohammadreza Bolandnazar, Woonghee Tim Huh, S. Thomas McCormick, Kazuo Murota
2018	J	`jnl`	Matroid optimisation problems with nested non-linear monomials in the objective function. Math. Program. Anja Fischer, Frank Fischer, S. Thomas McCormick
2017	J	`jnl`	On Integral Policies in Deterministic and Stochastic Distribution Systems. Oper. Res. Yang Bo, Milind Dawande, Ganesh Janakiraman, S. Thomas McCormick
2017	J	`jnl`	Primal-Dual Algorithms for Precedence Constrained Covering Problems. Algorithmica S. Thomas McCormick, Britta Peis, José Verschae, Andreas Wierz
2017	J	`jnl`	Protection of flows under targeted attacks. Oper. Res. Lett. Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo, Britta Peis, Martin Skutella
2017	A*	`conf`	Rerouting Flows When Links Fail. ICALP Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo
2017	J	`jnl`	Rerouting flows when links fail. CoRR Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo
2016	J	`jnl`	Protection of flows under targeted attacks. CoRR Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo, Britta Peis, Martin Skutella
2015	J	`jnl`	Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs. Math. Program. Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne
2014	B	`conf`	A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts. IPCO Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne
2014	J	`jnl`	Price Incentives and Coordination in a Two-Product Decentralized Supply Chain. Decis. Sci. Jing Shao, Harish Krishnan, S. Thomas McCormick
2014	B	`conf`	Primal-Dual Algorithms for Precedence Constrained Covering Problems. WAOA Andreas Wierz, Britta Peis, S. Thomas McCormick
2012	J	`jnl`	Structural and algorithmic properties for parametric minimum cuts. Math. Program. Frieda Granot, S. Thomas McCormick, Maurice Queyranne, Fabio Tardella
2011	B	`conf`	A Primal-Dual Algorithm for Weighted Abstract Cut Packing. IPCO S. Thomas McCormick, Britta Peis
2011	J	`jnl`	Incentives for Transshipment in a Supply Chain with Decentralized Retailers. Manuf. Serv. Oper. Manag. Jing Shao, Harish Krishnan, S. Thomas McCormick
2010	J	`jnl`	Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation. Math. Program. Ali Ridha Mahjoub, S. Thomas McCormick
2010	J	`jnl`	Separation, dimension, and facet algorithms for node flow polyhedra. Math. Program. Maren Martens, S. Thomas McCormick, Maurice Queyranne
2010	J	`jnl`	Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization. Math. Program. S. Thomas McCormick, Satoru Fujishige
2008	B	`conf`	A Polynomial Algorithm for Weighted Abstract Flow. IPCO Maren Martens, S. Thomas McCormick
2008	J	`jnl`	A Special Issue in Memory of George B. Dantzig. Discret. Optim. Egon Balas, Alan J. Hoffman, S. Thomas McCormick
2008	A*	`conf`	Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization. SODA S. Thomas McCormick, Satoru Fujishige
2006	J	`jnl`	Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut. Math. Program. Bernard Fortz, Ali Ridha Mahjoub, S. Thomas McCormick, Pierre Pesneau
2005	J	`jnl`	A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow. SIAM J. Discret. Math. Satoru Iwata, S. Thomas McCormick, Maiko Shigeno
2003	J	`jnl`	Easy and difficult objective functions for max cut. Math. Program. S. Thomas McCormick, M. R. Rao, Giovanni Rinaldi
2003	J	`jnl`	Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*. Comb. Satoru Iwata, S. Thomas McCormick, Maiko Shigeno
2002	J	`jnl`	A faster capacity scaling algorithm for minimum cost submodular flow. Math. Program. Lisa Fleischer, Satoru Iwata, S. Thomas McCormick
2001	J	`jnl`	A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths. Math. Oper. Res. S. Thomas McCormick, Scott R. Smallwood, Frits C. R. Spieksma
2000	J	`jnl`	A fast cost scaling algorithm for submodular flow. Inf. Process. Lett. Satoru Iwata, S. Thomas McCormick, Maiko Shigeno
2000	A*	`conf`	Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks. SODA S. Thomas McCormick, Akiyoshi Shioura
2000	J	`jnl`	Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks. Oper. Res. Lett. S. Thomas McCormick, Akiyoshi Shioura
2000	J	`jnl`	Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow. Math. Oper. Res. Maiko Shigeno, Satoru Iwata, S. Thomas McCormick
1999	B	`conf`	A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem. IPCO Satoru Iwata, S. Thomas McCormick, Maiko Shigeno
1999	J	`jnl`	Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow. Oper. Res. S. Thomas McCormick
1998	A*	`conf`	A Faster Algorithm for Minimum Cost Submodular Flows. SODA Satoru Iwata, S. Thomas McCormick, Maiko Shigeno
1998	J	`jnl`	A fast bipartite network flow algorithm for selective assembly. Oper. Res. Lett. Satoru Iwata, Tomomi Matsui, S. Thomas McCormick
1997	J	`jnl`	How to compute least infeasible flows. Math. Program. S. Thomas McCormick
1997	A*	`conf`	Polynomial Algorithms for Multiprocessor Scheduling with a Small Number of Job Lengths. SODA S. Thomas McCormick, Scott R. Smallwood, Frits C. R. Spieksma
1997	J	`jnl`	Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications. SIAM J. Comput. Alexander V. Karzanov, S. Thomas McCormick
1996	A*	`conf`	A Polynomial Algorithm for Abstract Maximum Flow. SODA S. Thomas McCormick
1996	A*	`conf`	Fast Algorithms for Parametric Scheduling Come from Extensions to Parametric Maximum Flow. STOC S. Thomas McCormick
1996	B	`ed.`	Integer Programming and Combinatorial Optimization, 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings IPCO William H. Cunningham, S. Thomas McCormick, Maurice Queyranne
1996	J	`jnl`	Submodular containment is hard, even for networks. Oper. Res. Lett. S. Thomas McCormick
1995	A*	`conf`	Polynomial Methods for Separable Convex Optimization in Unimodular Spaces. SODA Alexander V. Karzanov, S. Thomas McCormick
1995	J	`jnl`	Scheduling INFORMS J. Comput. S. Thomas McCormick, Michael L. Pinedo
1994	J	`jnl`	Computing Maximum Mean Cuts. Discret. Appl. Math. S. Thomas McCormick, Thomas R. Ervolina
1993	J	`jnl`	Approximate binary search algorithms for mean cuts and cycles. Oper. Res. Lett. S. Thomas McCormick
1993	J	`jnl`	Canceling most helpful total cuts for minimum cost network flow. Networks Thomas R. Ervolina, S. Thomas McCormick
1993	B	`conf`	Canceling most helpful total submodular cuts for submodular flow. IPCO S. Thomas McCormick, Thomas R. Ervolina
1993	J	`jnl`	Implementation and computational results for the hierarchical algorithm for making sparse matrices sparser. ACM Trans. Math. Softw. S. Frank Chang, S. Thomas McCormick
1993	J	`jnl`	The Weighted Sparsity Problem: Complexity and Algorithms. SIAM J. Discret. Math. S. Thomas McCormick, S. Frank Chang
1993	J	`jnl`	Two Strongly Polynomial Cut Cancelling Algorithms for Minimum Cost Network Flow. Discret. Appl. Math. Thomas R. Ervolina, S. Thomas McCormick
1992	J	`jnl`	A hierarchical algorithm for making sparse matrices sparser. Math. Program. S. Frank Chang, S. Thomas McCormick
1992	J	`jnl`	Finding disjoint paths with different path-costs: Complexity and algorithms. Networks Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi
1992	J	`jnl`	On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems. Oper. Res. Lett. Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi
1992	J	`jnl`	The point-to-point delivery and connection problems: complexity and algorithms. Discret. Appl. Math. Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi
1991	—	`conf`	An Experimental Implementation of the Dual Cancel and Tighten Algorithm for Minimum-Cost Network Flow. Network Flows And Matching S. Thomas McCormick, Li Liu
1991	J	`jnl`	Integral infeasibility and testing total dual integrality. Oper. Res. Lett. David L. Applegate, William J. Cook, S. Thomas McCormick
1991	J	`jnl`	Making sparse matrices sparser: Computational results. Math. Program. S. Thomas McCormick
1990	J	`jnl`	The complexity of finding two disjoint paths with min-max objective function. Discret. Appl. Math. Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi
1989	J	`jnl`	Sequencing in an Assembly Line with Blocking to Minimize Cycle Time. Oper. Res. S. Thomas McCormick, Michael L. Pinedo, Scott Shenker, Barry Wolf
1987	J	`jnl`	Conditional covering: Greedy heuristics and computational results. Comput. Oper. Res. Sohail S. Chaudhry, I. Douglas Moon, S. Thomas McCormick
1983	J	`jnl`	Optimal approximation of sparse hessians and its equivalence to a graph coloring problem. Math. Program. S. Thomas McCormick