Matthew J. Saltzman

Publication Activity (10 Years)

Years Active: 1989-2022
Publications (10 Years): 1

Top Topics

Stanford University

Plan Generation

Top Venues

INFORMS J. Comput.

INFORMS J. Appl. Anal.

Publications

Amy B. Gore, Mary E. Kurz, Matthew J. Saltzman, Blake Splitter, William C. Bridges, Neil J. Calkin
Clemson University's Rotational Attendance Plan During COVID-19. INFORMS J. Appl. Anal. 52 (6) (2022)
Matthew J. Saltzman
Book Reviews. INFORMS J. Comput. 27 (1) (2015)
Matthew J. Saltzman
Book Reviews. INFORMS J. Comput. 25 (3) (2013)
Peter M. Hahn, Yi-Rong Zhu, Monique Guignard, William L. Hightower, Matthew J. Saltzman
A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem. INFORMS J. Comput. 24 (2) (2012)
Peter M. Hahn, Matthew J. Saltzman
A New Branch-and-Bound Solver for the Quadratic Assignment Problem Based on the Level-3 Reformulation-Linearization Technique. Stud. Inform. Univ. 8 (2) (2010)
Y. Xu, Ted K. Ralphs, Laszlo Ladányi, Matthew J. Saltzman
Computational Experience with a Software Framework for Parallel Integer Programming. INFORMS J. Comput. 21 (3) (2009)
Ted K. Ralphs, Matthew J. Saltzman, Margaret M. Wiecek
An improved algorithm for solving biobjective integer programs. Ann. Oper. Res. 147 (1) (2006)
Ted K. Ralphs, Laszlo Ladányi, Matthew J. Saltzman
A Library Hierarchy for Implementing Scalable Parallel Search Algorithms. J. Supercomput. 28 (2) (2004)
Ted K. Ralphs, Laszlo Ladányi, Matthew J. Saltzman
Parallel branch, cut, and price for large-scale discrete optimization. Math. Program. 98 (1-3) (2003)
Laszlo Ladányi, Ted K. Ralphs, Matthew J. Saltzman
Implementing Scalable Parallel Search Algorithms for Data-Intensive Applications. International Conference on Computational Science (1) (2002)
Marie Coffin, Matthew J. Saltzman
Statistical Analysis of Computational Tests of Algorithms and Heuristics. INFORMS J. Comput. 12 (1) (2000)
Richard A. Tapia, Yin Zhang, Matthew J. Saltzman, Alan Weiser
The Mehrotra Predictor-Corrector Interior-Point Method As a Perturbed Composite Newton Method. SIAM J. Optim. 6 (1) (1996)
Ho-Won Jung, Roy E. Marsten, Matthew J. Saltzman
Numerical Factorization Methods for Interior Point Algorithms. INFORMS J. Comput. 6 (1) (1994)
Robert E. Bixby, Matthew J. Saltzman
Recovering an optimal LP basis from an interior point solution. Oper. Res. Lett. 15 (4) (1994)
Egon Balas, Matthew J. Saltzman
An Algorithm for the Three-Index Assignment Problem. Oper. Res. 39 (1) (1991)
Matthew J. Saltzman, Kevin S. McCurley
Book Reviews. INFORMS J. Comput. 2 (4) (1990)
Roy E. Marsten, Matthew J. Saltzman, David F. Shanno, George S. Pierce, J. F. Ballintijn
Implementation of a Dual Affine Interior Point Algorithm for Linear Programming. INFORMS J. Comput. 1 (4) (1989)
Egon Balas, Matthew J. Saltzman
Facets of the three-index assignment polytope. Discret. Appl. Math. 23 (3) (1989)