 | 2009 |
| 9 |  | Y. Xu,
Ted K. Ralphs,
Laszlo Ladányi,
Matthew J. Saltzman:
Computational Experience with a Software Framework for Parallel Integer Programming.
INFORMS Journal on Computing 21(3): 383-397 (2009) |
| 2006 |
| 8 |  | Ted K. Ralphs,
Matthew J. Saltzman,
Margaret M. Wiecek:
An improved algorithm for solving biobjective integer programs.
Annals OR 147(1): 43-70 (2006) |
| 2004 |
| 7 |  | Ted K. Ralphs,
Laszlo Ladányi,
Matthew J. Saltzman:
A Library Hierarchy for Implementing Scalable Parallel Search Algorithms.
The Journal of Supercomputing 28(2): 215-234 (2004) |
| 2002 |
| 6 |  | 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: 592-602 |
| 2000 |
| 5 |  | Marie Coffin,
Matthew J. Saltzman:
Statistical Analysis of Computational Tests of Algorithms and Heuristics.
INFORMS Journal on Computing 12(1): 24-44 (2000) |
| 1994 |
| 4 |  | Ho-Won Jung,
Roy E. Marsten,
Matthew J. Saltzman:
Numerical Factorization Methods for Interior Point Algorithms.
INFORMS Journal on Computing 6(1): 94-105 (1994) |
| 1990 |
| 3 |  | Matthew J. Saltzman,
Kevin S. McCurley:
Book Reviews.
INFORMS Journal on Computing 2(4): 365-368 (1990) |
| 1989 |
| 2 |  | Egon Balas,
Matthew J. Saltzman:
Facets of the three-index assignment polytope.
Discrete Applied Mathematics 23(3): 201-229 (1989) |
| 1 |  | 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 Journal on Computing 1(4): 287-297 (1989) |