Matthew J. Saltzman

905 total citations
17 papers, 519 citations indexed

About

Matthew J. Saltzman is a scholar working on Computational Theory and Mathematics, Industrial and Manufacturing Engineering and Numerical Analysis. According to data from OpenAlex, Matthew J. Saltzman has authored 17 papers receiving a total of 519 indexed citations (citations by other indexed papers that have themselves been cited), including 11 papers in Computational Theory and Mathematics, 8 papers in Industrial and Manufacturing Engineering and 5 papers in Numerical Analysis. Recurrent topics in Matthew J. Saltzman's work include Vehicle Routing Optimization Methods (7 papers), Advanced Optimization Algorithms Research (5 papers) and Scheduling and Optimization Algorithms (3 papers). Matthew J. Saltzman is often cited by papers focused on Vehicle Routing Optimization Methods (7 papers), Advanced Optimization Algorithms Research (5 papers) and Scheduling and Optimization Algorithms (3 papers). Matthew J. Saltzman collaborates with scholars based in United States, Netherlands and South Korea. Matthew J. Saltzman's co-authors include Egon Balas, Ted K. Ralphs, Marie Coffin, Roy E. Marsten, David F. Shanno, Margaret M. Wiecek, Robert E. Bixby, İlker Baybars, L. Ladányi and Irvin J. Lustig and has published in prestigious journals such as European Journal of Operational Research, Operations Research and Mathematical Programming.

In The Last Decade

Matthew J. Saltzman

16 papers receiving 469 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Matthew J. Saltzman United States	12	222	170	130	104	98	17	519
Gerald Gamrath Germany	8	180 0.8×	176 1.0×	96 0.7×	107 1.0×	90 0.9×	14	512
Sanjeeb Dash United States	15	341 1.5×	278 1.6×	101 0.8×	109 1.0×	60 0.6×	46	714
Jordi Castro Spain	14	101 0.5×	193 1.1×	193 1.5×	56 0.5×	84 0.9×	52	543
Milan Vlach Czechia	13	187 0.8×	132 0.8×	39 0.3×	107 1.0×	146 1.5×	60	573
Harvey M. Salkin United States	10	399 1.8×	117 0.7×	68 0.5×	172 1.7×	96 1.0×	25	703
Gordon H. Bradley United States	11	176 0.8×	163 1.0×	96 0.7×	117 1.1×	172 1.8×	22	573
O. du Merle Switzerland	8	240 1.1×	96 0.6×	109 0.8×	55 0.5×	67 0.7×	10	497
Toshihide Ibaraki Japan	3	133 0.6×	83 0.5×	42 0.3×	245 2.4×	52 0.5×	3	509
Akiyoshi Shioura Japan	16	162 0.7×	346 2.0×	82 0.6×	208 2.0×	31 0.3×	69	758
Didier El Baz France	15	223 1.0×	201 1.2×	118 0.9×	246 2.4×	32 0.3×	59	673

Countries citing papers authored by Matthew J. Saltzman

Since Specialization

Citations

This map shows the geographic impact of Matthew J. Saltzman's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Matthew J. Saltzman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Matthew J. Saltzman more than expected).

Fields of papers citing papers by Matthew J. Saltzman

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Matthew J. Saltzman. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Matthew J. Saltzman. The network helps show where Matthew J. Saltzman may publish in the future.

Co-authorship network of co-authors of Matthew J. Saltzman

This figure shows the co-authorship network connecting the top 25 collaborators of Matthew J. Saltzman. A scholar is included among the top collaborators of Matthew J. Saltzman based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Matthew J. Saltzman. Matthew J. Saltzman is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

17 of 17 papers shown

Kurz, Mary E., et al.. (2022). Clemson University’s Rotational Attendance Plan During COVID-19. RePEc: Research Papers in Economics. 52(6). 553–567. 5 indexed citations

Bridges, William C., et al.. (2020). Log transformations: What not to expect when you’re expecting. Communication in Statistics- Theory and Methods. 51(5). 1514–1521. 2 indexed citations

Hahn, Peter, et al.. (2011). A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem. INFORMS journal on computing. 24(2). 202–209. 34 indexed citations

Hahn, Peter & Matthew J. Saltzman. (2010). A New Branch-and-Bound Solver for the Quadratic Assignment Problem Based on the Level-3 Reformulation-Linearization Technique.. 8. 97–106.

Xu, Yan, Ted K. Ralphs, L. Ladányi, & Matthew J. Saltzman. (2009). Computational Experience with a Software Framework for Parallel Integer Programming. INFORMS journal on computing. 21(3). 383–397. 26 indexed citations

Ralphs, Ted K., Matthew J. Saltzman, & Margaret M. Wiecek. (2006). An improved algorithm for solving biobjective integer programs. Annals of Operations Research. 147(1). 43–70. 52 indexed citations

Ralphs, Ted K., L. Ladányi, & Matthew J. Saltzman. (2004). A Library Hierarchy for Implementing Scalable Parallel Search Algorithms. The Journal of Supercomputing. 28(2). 215–234. 16 indexed citations

Ralphs, Ted K., et al.. (2003). Parallel branch, cut, and price for large-scale discrete optimization. Mathematical Programming. 98(1-3). 253–280. 37 indexed citations

Coffin, Marie & Matthew J. Saltzman. (2000). Statistical Analysis of Computational Tests of Algorithms and Heuristics. INFORMS journal on computing. 12(1). 24–44. 49 indexed citations

10.

Saltzman, Matthew J.. (1998). Linear Programming Duality. 1 indexed citations

11.

Bixby, Robert E. & Matthew J. Saltzman. (1994). Recovering an optimal LP basis from an interior point solution. Operations Research Letters. 15(4). 169–178. 28 indexed citations

12.

Jung, Ho‐Won, Roy E. Marsten, & Matthew J. Saltzman. (1994). Numerical Factorization Methods for Interior Point Algorithms. INFORMS Journal on Computing. 6(1). 94–105. 6 indexed citations

13.

Balas, Egon & Matthew J. Saltzman. (1991). An Algorithm for the Three-Index Assignment Problem. Operations Research. 39(1). 150–161. 103 indexed citations

14.

Marsten, Roy E., et al.. (1990). Interior Point Methods for Linear Programming: Just Call Newton, Lagrange, and Fiacco and McCormick!. INFORMS Journal on Applied Analytics. 20(4). 105–116. 53 indexed citations

15.

Marsten, Roy E., et al.. (1989). Implementation of a Dual Affine Interior Point Algorithm for Linear Programming. INFORMS Journal on Computing. 1(4). 287–297. 37 indexed citations

16.

Balas, Egon & Matthew J. Saltzman. (1989). Facets of the three-index assignment polytope. Discrete Applied Mathematics. 23(3). 201–229. 46 indexed citations

17.

Saltzman, Matthew J. & İlker Baybars. (1987). A two-process implicit enumeration algorithm for the simple assembly line balancing problem. European Journal of Operational Research. 32(1). 118–129. 24 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact