Matthew J. Saltzman - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 19 from 19

2022

Clemson University's Rotational Attendance Plan During COVID-19Amy B. Gore, Mary E. Kurz, Matthew J. Saltzman, Blake Splitter, William C. Bridges, Neil J. Calkin. interfaces, 52(6):553-567, 2022. [doi]

2015

Book ReviewsMatthew J. Saltzman. informs, 27(1):189-192, 2015. [doi]

2013

Book ReviewsMatthew J. Saltzman. informs, 25(3):597-598, 2013. [doi]

2012

A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment ProblemPeter M. Hahn, Yi-Rong Zhu, Monique Guignard, William L. Hightower, Matthew J. Saltzman. informs, 24(2):202-209, 2012. [doi]

2010

A New Branch-and-Bound Solver for the Quadratic Assignment Problem Based on the Level-3 Reformulation-Linearization TechniquePeter M. Hahn, Matthew J. Saltzman. siu, 8(2):97-106, 2010. [doi]

2009

Computational Experience with a Software Framework for Parallel Integer ProgrammingY. Xu, Ted K. Ralphs, Laszlo LadÃ¡nyi, Matthew J. Saltzman. informs, 21(3):383-397, 2009. [doi]

2006

An improved algorithm for solving biobjective integer programsTed K. Ralphs, Matthew J. Saltzman, Margaret M. Wiecek. anor, 147(1):43-70, 2006. [doi]

2004

A Library Hierarchy for Implementing Scalable Parallel Search AlgorithmsTed K. Ralphs, Laszlo Ladányi, Matthew J. Saltzman. tjs, 28(2):215-234, 2004. [doi]

2003

Parallel branch, cut, and price for large-scale discrete optimizationTed K. Ralphs, Laszlo Ladányi, Matthew J. Saltzman. mp, 98(1-3):253-280, 2003. [doi]

2002

Implementing Scalable Parallel Search Algorithms for Data-Intensive ApplicationsLaszlo Ladányi, Ted K. Ralphs, Matthew J. Saltzman. iccS 2002: 592-602 [doi]

2000

Statistical Analysis of Computational Tests of Algorithms and HeuristicsMarie Coffin, Matthew J. Saltzman. informs, 12(1):24-44, 2000. [doi]

1996

The Mehrotra Predictor-Corrector Interior-Point Method As a Perturbed Composite Newton MethodRichard A. Tapia, Yin Zhang, Matthew J. Saltzman, Alan Weiser. siamjo, 6(1):47-56, 1996. [doi]

1994

Recovering an optimal LP basis from an interior point solutionRobert E. Bixby, Matthew J. Saltzman. orl, 15(4):169-178, 1994. [doi]

Numerical Factorization Methods for Interior Point AlgorithmsHo-Won Jung, Roy E. Marsten, Matthew J. Saltzman. informs, 6(1):94-105, 1994. [doi]

1992

Implementation of an interior Point LP Algorithm on a Shared-Memory Vector MultiprocessorMatthew J. Saltzman. In Osman Balci, Ramesh Sharda, Stavros A. Zenios, editors, Computer Science and Operations Research. pages 87-101, Pergamon Press, 1992. [doi]

1991

An Algorithm for the Three-Index Assignment ProblemEgon Balas, Matthew J. Saltzman. ior, 39(1):150-161, 1991. [doi]

1990

Book ReviewsMatthew J. Saltzman, Kevin S. McCurley. informs, 2(4):365-368, 1990. [doi]

1989

Facets of the three-index assignment polytopeEgon Balas, Matthew J. Saltzman. DAM, 23(3):201-229, 1989. [doi]

Implementation of a Dual Affine Interior Point Algorithm for Linear ProgrammingRoy E. Marsten, Matthew J. Saltzman, David F. Shanno, George S. Pierce, J. F. Ballintijn. informs, 1(4):287-297, 1989. [doi]

Sign in or sign up to see more results.

runs on WebDSL