PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "McCormick, S. Thomas"

Author of the publication

copydeleteadd this publication to your clipboard
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)

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.

S. Schumann

S. Seemann

S. Wartzack

Boettinger S

S. Toro

 

Other publications of authors with the same name

A hierarchical algorithm for making sparse matrices sparser., and . Math. Program., (1992)Two Strongly Polynomial Cut Cancelling Algorithms for Minimum Cost Network Flow., and . Discrete Applied Mathematics, 46 (2): 133-165 (1993)The point-to-point delivery and connection problems: complexity and algorithms., , and . Discrete Applied Mathematics, 36 (3): 267-292 (1992)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 Polynomial Algorithm for Abstract Maximum Flow.. SODA, page 490-497. ACM/SIAM, (1996)Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut., , , and . Math. Program., 105 (1): 85-111 (2006)Implementation and computational results for the hierarchical algorithm for making sparse matrices sparser., and . ACM Trans. Math. Softw., 19 (3): 419-441 (1993)A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts., , , and . IPCO, volume 8494 of Lecture Notes in Computer Science, page 25-36. Springer, (2014)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)