Facets of the three-index assignment polytope. - Egon Balas; Matthew J. Saltzman (Discret. Appl. Math., 1989)

Implementation of a Dual Affine Interior Point Algorithm for Linear Programming. - Roy E. Marsten; Matthew J. Saltzman; David F. Shanno; George S. Pierce; J. F. Ballintijn (INFORMS J. Comput., 1989)

Book Reviews. - Matthew J. Saltzman; Kevin S. McCurley (INFORMS J. Comput., 1990)

An Algorithm for the Three-Index Assignment Problem. - Egon Balas; Matthew J. Saltzman (Oper. Res., 1991)

Implementation of an interior Point LP Algorithm on a Shared-Memory Vector Multiprocessor. - Matthew J. Saltzman (Computer Science and Operations Research, 1992)

Numerical Factorization Methods for Interior Point Algorithms. - Ho-Won Jung; Roy E. Marsten; Matthew J. Saltzman (INFORMS J. Comput., 1994)

Recovering an optimal LP basis from an interior point solution. - Robert E. Bixby; Matthew J. Saltzman (Oper. Res. Lett., 1994)

The Mehrotra Predictor-Corrector Interior-Point Method As a Perturbed Composite Newton Method. - Richard A. Tapia; Yin Zhang 010; Matthew J. Saltzman; Alan Weiser (SIAM J. Optim., 1996)

Statistical Analysis of Computational Tests of Algorithms and Heuristics. - Marie Coffin; Matthew J. Saltzman (INFORMS J. Comput., 2000)

Implementing Scalable Parallel Search Algorithms for Data-Intensive Applications. - Laszlo Ladányi; Ted K. Ralphs; Matthew J. Saltzman (International Conference on Computational Science (1), 2002)

Parallel branch, cut, and price for large-scale discrete optimization. - Ted K. Ralphs; Laszlo Ladányi; Matthew J. Saltzman (Math. Program., 2003)

A Library Hierarchy for Implementing Scalable Parallel Search Algorithms. - Ted K. Ralphs; Laszlo Ladányi; Matthew J. Saltzman (J. Supercomput., 2004)

An improved algorithm for solving biobjective integer programs. - Ted K. Ralphs; Matthew J. Saltzman; Margaret M. Wiecek (Ann. Oper. Res., 2006)

Computational Experience with a Software Framework for Parallel Integer Programming. - Y. Xu; Ted K. Ralphs; Laszlo Ladányi; Matthew J. Saltzman (INFORMS J. Comput., 2009)

A New Branch-and-Bound Solver for the Quadratic Assignment Problem Based on the Level-3 Reformulation-Linearization Technique. - Peter M. Hahn; Matthew J. Saltzman (Stud. Inform. Univ., 2010)

A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem. - Peter M. Hahn; Yi-Rong Zhu; Monique Guignard 001; William L. Hightower; Matthew J. Saltzman (INFORMS J. Comput., 2012)

Book Reviews. - Matthew J. Saltzman (INFORMS J. Comput., 2015)

Clemson University's Rotational Attendance Plan During COVID-19. - Amy B. Gore; Mary E. Kurz; Matthew J. Saltzman; Blake Splitter; William C. Bridges; Neil J. Calkin (INFORMS J. Appl. Anal., 2022)