Matuschke, Jannik; McCormick, S. Thomas; Oriolo, Gianpaolo Rerouting flows when links fail. (English) Zbl 1450.05038 SIAM J. Discrete Math. 34, No. 4, 2082-2107 (2020). MSC: 05C21 05C85 05C82 90B10 PDFBibTeX XMLCite \textit{J. Matuschke} et al., SIAM J. Discrete Math. 34, No. 4, 2082--2107 (2020; Zbl 1450.05038) Full Text: DOI arXiv
Matuschke, Jannik; McCormick, S. Thomas; Oriolo, Gianpaolo; Peis, Britta; Skutella, Martin Protection of flows under targeted attacks. (English) Zbl 1409.90042 Oper. Res. Lett. 45, No. 1, 53-59 (2017). MSC: 90B10 90C35 PDFBibTeX XMLCite \textit{J. Matuschke} et al., Oper. Res. Lett. 45, No. 1, 53--59 (2017; Zbl 1409.90042) Full Text: DOI arXiv
McCormick, S. Thomas; Peis, Britta A primal-dual algorithm for weighted abstract cut packing. (English) Zbl 1341.90115 Günlük, Oktay (ed.) et al., Integer programming and combinatoral optimization. 15th international conference, IPCO 2011, New York, NY, USA, June 15–17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20806-5/pbk). Lecture Notes in Computer Science 6655, 324-335 (2011). MSC: 90C27 90C57 PDFBibTeX XMLCite \textit{S. T. McCormick} and \textit{B. Peis}, Lect. Notes Comput. Sci. 6655, 324--335 (2011; Zbl 1341.90115) Full Text: DOI
Martens, Maren; McCormick, S. Thomas; Queyranne, Maurice Separation, dimension, and facet algorithms for node flow polyhedra. (English) Zbl 1220.90039 Math. Program. 124, No. 1-2 (B), 317-348 (2010). Reviewer: Eleonor Ciurea (Braşov) MSC: 90B10 90C90 PDFBibTeX XMLCite \textit{M. Martens} et al., Math. Program. 124, No. 1--2 (B), 317--348 (2010; Zbl 1220.90039) Full Text: DOI
Mahjoub, A. Ridha; McCormick, S. Thomas Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation. (English) Zbl 1198.90072 Math. Program. 124, No. 1-2 (B), 271-284 (2010). MSC: 90B10 90C59 90B18 PDFBibTeX XMLCite \textit{A. R. Mahjoub} and \textit{S. T. McCormick}, Math. Program. 124, No. 1--2 (B), 271--284 (2010; Zbl 1198.90072) Full Text: DOI
Iwata, Satoru; Matsui, Tomomi; McCormick, S. Thomas A fast bipartite network flow algorithm for selective assembly. (English) Zbl 0911.90209 Oper. Res. Lett. 22, No. 4-5, 137-143 (1998). MSC: 90B35 90C60 90B10 PDFBibTeX XMLCite \textit{S. Iwata} et al., Oper. Res. Lett. 22, No. 4--5, 137--143 (1998; Zbl 0911.90209) Full Text: DOI
McCormick, S. Thomas How to compute least infeasible flows. (English) Zbl 0889.90065 Math. Program. 78, No. 2 (B), 179-194 (1997). MSC: 90B10 90C35 PDFBibTeX XMLCite \textit{S. T. McCormick}, Math. Program. 78, No. 2 (B), 179--194 (1997; Zbl 0889.90065) Full Text: DOI
Chang, S. Frank; McCormick, S. Thomas A hierarchical algorithm for making sparse matrices sparser. (English) Zbl 0770.90039 Math. Program., Ser. A 56, No. 1, 1-30 (1992). MSC: 90C05 90C06 PDFBibTeX XMLCite \textit{S. F. Chang} and \textit{S. T. McCormick}, Math. Program. 56, No. 1 (A), 1--30 (1992; Zbl 0770.90039) Full Text: DOI
Applegate, David L.; Cook, William; McCormick, S. Thomas Integral infeasibility and testing total dual integrality. (English) Zbl 0722.90057 Oper. Res. Lett. 10, No. 1, 37-41 (1991). Reviewer: W.Li (Changsha) MSC: 90C27 90C10 93C05 90C35 52B12 68R10 05C85 PDFBibTeX XMLCite \textit{D. L. Applegate} et al., Oper. Res. Lett. 10, No. 1, 37--41 (1991; Zbl 0722.90057) Full Text: DOI
McCormick, S. Thomas Making sparse matrices sparser: Computational results. (English) Zbl 0714.90067 Math. Program., Ser. A 49, No. 1, 91-111 (1990). MSC: 90C06 90C05 90-08 PDFBibTeX XMLCite \textit{S. T. McCormick}, Math. Program. 49, No. 1 (A), 91--111 (1990; Zbl 0714.90067) Full Text: DOI