default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew J. Saltzman
Person information
- affiliation: Clemson University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j17]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): 553-567 (2022)
2010 – 2019
- 2015
- [j16]Matthew J. Saltzman:
Book Reviews. INFORMS J. Comput. 27(1): 189-192 (2015) - 2013
- [j15]Matthew J. Saltzman:
Book Reviews. INFORMS J. Comput. 25(3): 597-598 (2013) - 2012
- [j14]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): 202-209 (2012) - 2010
- [j13]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): 97-106 (2010)
2000 – 2009
- 2009
- [j12]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): 383-397 (2009) - 2006
- [j11]Ted K. Ralphs, Matthew J. Saltzman, Margaret M. Wiecek:
An improved algorithm for solving biobjective integer programs. Ann. Oper. Res. 147(1): 43-70 (2006) - 2004
- [j10]Ted K. Ralphs, Laszlo Ladányi, Matthew J. Saltzman:
A Library Hierarchy for Implementing Scalable Parallel Search Algorithms. J. Supercomput. 28(2): 215-234 (2004) - 2003
- [j9]Ted K. Ralphs, Laszlo Ladányi, Matthew J. Saltzman:
Parallel branch, cut, and price for large-scale discrete optimization. Math. Program. 98(1-3): 253-280 (2003) - 2002
- [c1]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
- [j8]Marie Coffin, Matthew J. Saltzman:
Statistical Analysis of Computational Tests of Algorithms and Heuristics. INFORMS J. Comput. 12(1): 24-44 (2000)
1990 – 1999
- 1996
- [j7]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): 47-56 (1996) - 1994
- [j6]Ho-Won Jung, Roy E. Marsten, Matthew J. Saltzman:
Numerical Factorization Methods for Interior Point Algorithms. INFORMS J. Comput. 6(1): 94-105 (1994) - [j5]Robert E. Bixby, Matthew J. Saltzman:
Recovering an optimal LP basis from an interior point solution. Oper. Res. Lett. 15(4): 169-178 (1994) - 1992
- [p1]Matthew J. Saltzman:
Implementation of an interior Point LP Algorithm on a Shared-Memory Vector Multiprocessor. Computer Science and Operations Research 1992: 87-101 - 1991
- [j4]Egon Balas, Matthew J. Saltzman:
An Algorithm for the Three-Index Assignment Problem. Oper. Res. 39(1): 150-161 (1991) - 1990
- [j3]Matthew J. Saltzman, Kevin S. McCurley:
Book Reviews. INFORMS J. Comput. 2(4): 365-368 (1990)
1980 – 1989
- 1989
- [j2]Egon Balas, Matthew J. Saltzman:
Facets of the three-index assignment polytope. Discret. Appl. Math. 23(3): 201-229 (1989) - [j1]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): 287-297 (1989)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
