Matthew J. Saltzman

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