( en | de | ru )

 

Disambiguation of "McCormick, S. Thomas"

Author of the publication

copydeleteadd this publication to your clipboard
Incentives for Transshipment in a Supply Chain with Decentralized Retailers.

, , and . Manuf. Serv. Oper. Manag., 13 (3): 361-372 (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Cornelia McCormick

Matthew McCormick

Allison McCormick

Thomas S Rau

Thomas S Eberle

 

Other publications of authors with the same name

Primal-Dual Algorithms for Precedence Constrained Covering Problems., , , and . Algorithmica, 78 (3): 771-787 (2017)A Polynomial Algorithm for Abstract Maximum Flow.. SODA, page 490-497. ACM/SIAM, (1996)Implementation and computational results for the hierarchical algorithm for making sparse matrices sparser., and . ACM Trans. Math. Softw., 19 (3): 419-441 (1993)Rerouting Flows When Links Fail., , and . ICALP, volume 80 of LIPIcs, page 89:1-89:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem., , and . IPCO, volume 1610 of Lecture Notes in Computer Science, page 259-272. Springer, (1999)Finding disjoint paths with different path-costs: Complexity and algorithms., , and . Networks, 22 (7): 653-667 (1992)Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications., and . SIAM J. Comput., 26 (4): 1245-1275 (1997)A hierarchical algorithm for making sparse matrices sparser., and . Math. Program., (1992)Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut., , , and . Math. Program., 105 (1): 85-111 (2006)Two Strongly Polynomial Cut Cancelling Algorithms for Minimum Cost Network Flow., and . Discret. Appl. Math., 46 (2): 133-165 (1993)