default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDS. Thomas McCormick
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i6]Katharina Eickhoff, S. Thomas McCormick, Britta Peis, Niklas Rieken, Laura Vargas Koch:
A flow-based ascending auction to compute buyer-optimal Walrasian prices. CoRR abs/2304.14262 (2023)- 2022
- [j49]Anja Fischer, Frank Fischer
, S. Thomas McCormick:
Matroid optimization problems with monotone monomials in the objective. Discret. Appl. Math. 308: 20-35 (2022) - [j48]Maxwell Allman, Venus Lo, S. Thomas McCormick:
Complexity of Source-Sink Monotone 2-parameter min cut. Oper. Res. Lett. 50(1): 84-90 (2022) - 2021
- [j47]Yichuan Ding, S. Thomas McCormick, Mahesh Nagarajan:
A Fluid Model for One-Sided Bipartite Matching Queues with Match-Dependent Rewards. Oper. Res. 69(4): 1256-1281 (2021) - [j46]S. Thomas McCormick, Britta Peis, Robert Scheidweiler, Frank Vallentin:
A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices. SIAM J. Discret. Math. 35(4): 2345-2356 (2021) - [i5]Maxwell Allman, Venus Lo, S. Thomas McCormick:
Complexity of Source-Sink Monotone 2-Parameter Min Cut. CoRR abs/2107.09743 (2021) - 2020
- [j45]Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo:
Rerouting Flows when Links Fail. SIAM J. Discret. Math. 34(4): 2082-2107 (2020) - [c16]Hassene Aissi, S. Thomas McCormick, Maurice Queyranne:
Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts. IPCO 2020: 27-39 - [i4]S. Thomas McCormick, Britta Peis, Robert Scheidweiler, Frank Vallentin:
A polynomial time algorithm for solving the closest vector problem in zonotopal lattices. CoRR abs/2004.07574 (2020)
2010 – 2019
- 2019
- [j44]Mohammadreza Bolandnazar, Woonghee Tim Huh, S. Thomas McCormick, Kazuo Murota:
Technical Note - Error Noted in "Order-Based Cost Optimization in Assemble-to-Order Systems" by Lu and Song (2005). Oper. Res. 67(1): 163-166 (2019) - [i3]Hassene Aissi, S. Thomas McCormick, Maurice Queyranne:
Faster Algorithms for Parametric Global Minimum Cut Problems. CoRR abs/1911.11847 (2019) - 2018
- [j43]Anja Fischer, Frank Fischer, S. Thomas McCormick:
Matroid optimisation problems with nested non-linear monomials in the objective function. Math. Program. 169(2): 417-446 (2018) - 2017
- [j42]S. Thomas McCormick, Britta Peis, José Verschae, Andreas Wierz:
Primal-Dual Algorithms for Precedence Constrained Covering Problems. Algorithmica 78(3): 771-787 (2017) - [j41]Yang Bo, Milind Dawande, Ganesh Janakiraman, S. Thomas McCormick:
On Integral Policies in Deterministic and Stochastic Distribution Systems. Oper. Res. 65(3): 703-711 (2017) - [j40]Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo, Britta Peis, Martin Skutella:
Protection of flows under targeted attacks. Oper. Res. Lett. 45(1): 53-59 (2017) - [c15]Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo:
Rerouting Flows When Links Fail. ICALP 2017: 89:1-89:13 - [i2]Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo:
Rerouting flows when links fail. CoRR abs/1704.07067 (2017) - 2016
- [i1]Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo, Britta Peis, Martin Skutella:
Protection of flows under targeted attacks. CoRR abs/1601.03603 (2016) - 2015
- [j39]Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne:
Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs. Math. Program. 154(1-2): 3-28 (2015) - 2014
- [j38]Jing Shao, Harish Krishnan, S. Thomas McCormick:
Price Incentives and Coordination in a Two-Product Decentralized Supply Chain. Decis. Sci. 45(3): 507-533 (2014) - [c14]Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne:
A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts. IPCO 2014: 25-36 - [c13]Andreas Wierz, Britta Peis, S. Thomas McCormick:
Primal-Dual Algorithms for Precedence Constrained Covering Problems. WAOA 2014: 260-272 - 2012
- [j37]Frieda Granot, S. Thomas McCormick, Maurice Queyranne, Fabio Tardella:
Structural and algorithmic properties for parametric minimum cuts. Math. Program. 135(1-2): 337-367 (2012) - 2011
- [j36]Jing Shao, Harish Krishnan, S. Thomas McCormick:
Incentives for Transshipment in a Supply Chain with Decentralized Retailers. Manuf. Serv. Oper. Manag. 13(3): 361-372 (2011) - [c12]S. Thomas McCormick, Britta Peis:
A Primal-Dual Algorithm for Weighted Abstract Cut Packing. IPCO 2011: 324-335 - 2010
- [j35]S. Thomas McCormick, Satoru Fujishige:
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization. Math. Program. 122(1): 87-120 (2010) - [j34]Ali Ridha Mahjoub, S. Thomas McCormick:
Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation. Math. Program. 124(1-2): 271-284 (2010) - [j33]Maren Martens, S. Thomas McCormick, Maurice Queyranne:
Separation, dimension, and facet algorithms for node flow polyhedra. Math. Program. 124(1-2): 317-348 (2010)
2000 – 2009
- 2008
- [j32]Egon Balas, Alan J. Hoffman, S. Thomas McCormick:
A Special Issue in Memory of George B. Dantzig. Discret. Optim. 5(2): 145-150 (2008) - [c11]Maren Martens, S. Thomas McCormick:
A Polynomial Algorithm for Weighted Abstract Flow. IPCO 2008: 97-111 - [c10]S. Thomas McCormick, Satoru Fujishige:
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization. SODA 2008: 44-53 - 2006
- [j31]Bernard Fortz, Ali Ridha Mahjoub, S. Thomas McCormick, Pierre Pesneau:
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut. Math. Program. 105(1): 85-111 (2006) - 2005
- [j30]Satoru Iwata, S. Thomas McCormick, Maiko Shigeno:
A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow. SIAM J. Discret. Math. 19(2): 304-320 (2005) - 2003
- [j29]Satoru Iwata, S. Thomas McCormick, Maiko Shigeno:
Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*. Comb. 23(3): 503-525 (2003) - [j28]S. Thomas McCormick, M. R. Rao, Giovanni Rinaldi:
Easy and difficult objective functions for max cut. Math. Program. 94(2-3): 459-466 (2003) - 2002
- [j27]Lisa Fleischer, Satoru Iwata, S. Thomas McCormick:
A faster capacity scaling algorithm for minimum cost submodular flow. Math. Program. 92(1): 119-139 (2002) - 2001
- [j26]S. Thomas McCormick, Scott R. Smallwood, Frits C. R. Spieksma:
A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths. Math. Oper. Res. 26(1): 31-49 (2001) - 2000
- [j25]Satoru Iwata, S. Thomas McCormick, Maiko Shigeno:
A fast cost scaling algorithm for submodular flow. Inf. Process. Lett. 74(3-4): 123-128 (2000) - [j24]Maiko Shigeno, Satoru Iwata, S. Thomas McCormick:
Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow. Math. Oper. Res. 25(1): 76-104 (2000) - [j23]S. Thomas McCormick, Akiyoshi Shioura:
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks. Oper. Res. Lett. 27(5): 199-207 (2000) - [c9]S. Thomas McCormick, Akiyoshi Shioura:
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks. SODA 2000: 944-952
1990 – 1999
- 1999
- [j22]S. Thomas McCormick:
Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow. Oper. Res. 47(5): 744-756 (1999) - [c8]Satoru Iwata, S. Thomas McCormick, Maiko Shigeno:
A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem. IPCO 1999: 259-272 - 1998
- [j21]Satoru Iwata, Tomomi Matsui, S. Thomas McCormick:
A fast bipartite network flow algorithm for selective assembly. Oper. Res. Lett. 22(4-5): 137-143 (1998) - [c7]Satoru Iwata, S. Thomas McCormick, Maiko Shigeno:
A Faster Algorithm for Minimum Cost Submodular Flows. SODA 1998: 167-174 - 1997
- [j20]S. Thomas McCormick:
How to compute least infeasible flows. Math. Program. 77: 179-194 (1997) - [j19]Alexander V. Karzanov, S. Thomas McCormick:
Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications. SIAM J. Comput. 26(4): 1245-1275 (1997) - [c6]S. Thomas McCormick, Scott R. Smallwood, Frits C. R. Spieksma:
Polynomial Algorithms for Multiprocessor Scheduling with a Small Number of Job Lengths. SODA 1997: 509-517 - 1996
- [j18]S. Thomas McCormick:
Submodular containment is hard, even for networks. Oper. Res. Lett. 19(2): 95-99 (1996) - [c5]S. Thomas McCormick:
A Polynomial Algorithm for Abstract Maximum Flow. SODA 1996: 490-497 - [c4]S. Thomas McCormick:
Fast Algorithms for Parametric Scheduling Come from Extensions to Parametric Maximum Flow. STOC 1996: 319-328 - [e1]William H. Cunningham, S. Thomas McCormick, Maurice Queyranne:
Integer Programming and Combinatorial Optimization, 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings. Lecture Notes in Computer Science 1084, Springer 1996, ISBN 3-540-61310-2 [contents] - 1995
- [j17]S. Thomas McCormick, Michael L. Pinedo:
Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis. INFORMS J. Comput. 7(1): 63-77 (1995) - [c3]Alexander V. Karzanov, S. Thomas McCormick:
Polynomial Methods for Separable Convex Optimization in Unimodular Spaces. SODA 1995: 78-87 - 1994
- [j16]S. Thomas McCormick, Thomas R. Ervolina:
Computing Maximum Mean Cuts. Discret. Appl. Math. 52(1): 53-70 (1994) - 1993
- [j15]Thomas R. Ervolina, S. Thomas McCormick:
Two Strongly Polynomial Cut Cancelling Algorithms for Minimum Cost Network Flow. Discret. Appl. Math. 46(2): 133-165 (1993) - [j14]Thomas R. Ervolina, S. Thomas McCormick:
Canceling most helpful total cuts for minimum cost network flow. Networks 23(1): 41-52 (1993) - [j13]S. Thomas McCormick:
Approximate binary search algorithms for mean cuts and cycles. Oper. Res. Lett. 14(3): 129-132 (1993) - [j12]S. Thomas McCormick, S. Frank Chang:
The Weighted Sparsity Problem: Complexity and Algorithms. SIAM J. Discret. Math. 6(1): 57-69 (1993) - [j11]S. Frank Chang, S. Thomas McCormick:
Implementation and computational results for the hierarchical algorithm for making sparse matrices sparser. ACM Trans. Math. Softw. 19(3): 419-441 (1993) - [c2]S. Thomas McCormick, Thomas R. Ervolina:
Canceling most helpful total submodular cuts for submodular flow. IPCO 1993: 343-353 - 1992
- [j10]Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi:
The point-to-point delivery and connection problems: complexity and algorithms. Discret. Appl. Math. 36(3): 267-292 (1992) - [j9]S. Frank Chang, S. Thomas McCormick:
A hierarchical algorithm for making sparse matrices sparser. Math. Program. 56: 1-30 (1992) - [j8]Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi:
Finding disjoint paths with different path-costs: Complexity and algorithms. Networks 22(7): 653-667 (1992) - [j7]Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi:
On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems. Oper. Res. Lett. 11(5): 303-308 (1992) - 1991
- [j6]S. Thomas McCormick:
Making sparse matrices sparser: Computational results. Math. Program. 49: 91-111 (1991) - [j5]David L. Applegate, William J. Cook, S. Thomas McCormick:
Integral infeasibility and testing total dual integrality. Oper. Res. Lett. 10(1): 37-41 (1991) - [c1]S. Thomas McCormick, Li Liu:
An Experimental Implementation of the Dual Cancel and Tighten Algorithm for Minimum-Cost Network Flow. Network Flows And Matching 1991: 247-266 - 1990
- [j4]Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi:
The complexity of finding two disjoint paths with min-max objective function. Discret. Appl. Math. 26(1): 105-115 (1990)
1980 – 1989
- 1989
- [j3]S. Thomas McCormick, Michael L. Pinedo, Scott Shenker, Barry Wolf:
Sequencing in an Assembly Line with Blocking to Minimize Cycle Time. Oper. Res. 37(6): 925-935 (1989) - 1987
- [j2]Sohail S. Chaudhry, I. Douglas Moon, S. Thomas McCormick:
Conditional covering: Greedy heuristics and computational results. Comput. Oper. Res. 14(1): 11-18 (1987) - 1983
- [j1]S. Thomas McCormick:
Optimal approximation of sparse hessians and its equivalence to a graph coloring problem. Math. Program. 26(2): 153-171 (1983)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
