Matthew Saltzman
Matthew Saltzman
Associate Professor of Mathematical Sciences, Clemson University
Verified email at
Cited by
Cited by
An algorithm for the three-index assignment problem
E Balas, MJ Saltzman
Operations Research 39 (1), 150-161, 1991
Interior point methods for linear programming: Just call Newton, Lagrange, and Fiacco and McCormick!
R Marsten, R Subramanian, M Saltzman, I Lustig, D Shanno
Interfaces 20 (4), 105-116, 1990
Facets of the three-index assignment polytope
E Balas, MJ Saltzman
Discrete Applied Mathematics 23 (3), 201-229, 1989
An improved algorithm for solving biobjective integer programs
TK Ralphs, MJ Saltzman, MM Wiecek
Annals of Operations Research 147 (1), 43-70, 2006
Statistical analysis of computational tests of algorithms and heuristics
M Coffin, MJ Saltzman
INFORMS Journal on Computing 12 (1), 24-44, 2000
A three-dimensional mathematical model of temporomandibular joint loading
B May, S Saha, M Saltzman
Clinical Biomechanics 16 (6), 489-495, 2001
Parallel branch, cut, and price for large-scale discrete optimization
TK Ralphs, L Ladányi, MJ Saltzman
Mathematical Programming 98 (1), 253-280, 2003
Recovering an optimal LP basis from an interior point solution
RE Bixby, MJ Saltzman
Operations Research Letters 15 (4), 169-178, 1994
Implementation of a dual affine interior point algorithm for linear programming
RE Marsten, MJ Saltzman, DF Shanno, GS Pierce, JF Ballintijn
ORSA Journal on Computing 1 (4), 287-297, 1989
Alps: A framework for implementing parallel tree search algorithms
Y Xu, TK Ralphs, L Ladányi, MJ Saltzman
The next wave in computing, optimization, and decision technologies, 319-334, 2005
A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
PM Hahn, YR Zhu, M Guignard, WL Hightower, MJ Saltzman
INFORMS Journal on Computing 24 (2), 202-209, 2012
A library hierarchy for implementing scalable parallel search algorithms
TK Ralphs, L Ladányi, MJ Saltzman
The Journal of Supercomputing 28 (2), 215-234, 2004
Computational experience with a software framework for parallel integer programming
Y Xu, TK Ralphs, L Ladányi, MJ Saltzman
INFORMS Journal on Computing 21 (3), 383-397, 2009
The Mehrotra predictor-corrector interior-point method as a perturbed composite Newton method
R Tapia, Y Zhang, M Saltzman, A Weiser
SIAM Journal on Optimization 6 (1), 47-56, 1996
A two-process implicit enumeration algorithm for the simple assembly line balancing problem
MJ Saltzman, I Baybars
European Journal of Operational Research 32 (1), 118-129, 1987
COIN-OR: an open-source library for optimization
MJ Saltzman
Programming languages and systems in computational economics and finance, 3-32, 2002
coin-or/Cbc: Version 2.9. 9
J Forrest, T Ralphs, S Vigerske, L Hafer, B Kristjansson, JP Fasano, ...
URL http://dx. doi. org/10.5281/zenodo 1317566, 2018
Numerical factorization methods for interior point algorithms
HW Jung, RE Marsten, MJ Saltzman
ORSA Journal on Computing 6 (1), 94-105, 1994
Operations research and cyber-infrastructure
JW Chinneck, B Kristjansson, MJ Saltzman
Springer Science & Business Media, 2009
Survey: mixed-integer programming
MJ Saltzman
OR/MS Today 21 (2), 42-51, 1994
The system can't perform the operation now. Try again later.
Articles 1–20