Matthew J. Saltzman
- Industrial and Manufacturing Engineering top 2%
- Computational Theory and Mathematics top 5%
- Numerical Analysis top 5%
- Computer Networks and Communications top 10%
- Control and Systems Engineering top 10%
- Co-authors
- Egon BalasTed K. RalphsMarie CoffinRoy E. MarstenDavid F. ShannoMargaret M. WiecekRobert E. BixbyL. Ladányi
- Topics
- Vehicle Routing Optimization Methods (7 papers)Advanced Optimization Algorithms Research (5 papers)Scheduling and Optimization Algorithms (3 papers)
- Cited by
- Numerical AnalysisIndustrial and Manufacturing EngineeringComputational Theory and Mathematics
- Partner nations
- United StatesNetherlandsSouth Korea
In The Last Decade
Matthew J. Saltzman
16 papers receiving 469 citations
Peers
Comparison fields: 5 of 74
- Industrial and Manufacturing Engineering 222
- Computational Theory and Mathematics 170
- Numerical Analysis 130
- Computer Networks and Communications 104
- Control and Systems Engineering 98
Countries citing papers authored by Matthew J. Saltzman
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
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
| # | Work | Indexed citations |
|---|---|---|
| 1 | 5 | |
| 2 | 2 | |
| 3 | 34 | |
| 4 | A New Branch-and-Bound Solver for the Quadratic Assignment Problem Based on the Level-3 Reformulation-Linearization Technique. | 0 |
| 5 | 26 | |
| 6 | 52 | |
| 7 | 16 | |
| 8 | 37 | |
| 9 | 49 | |
| 10 | Linear Programming Duality | 1 |
| 11 | 28 | |
| 12 | 6 | |
| 13 | 103 | |
| 14 | 53 | |
| 15 | 46 | |
| 16 | 37 | |
| 17 | 24 |
About Matthew J. Saltzman
Matthew J. Saltzman is a scholar working on Numerical Analysis, Industrial and Manufacturing Engineering and Computational Theory and Mathematics, having authored 17 papers that have together received 519 indexed citations. Recurring topics across this work include Vehicle Routing Optimization Methods (7 papers), Advanced Optimization Algorithms Research (5 papers) and Scheduling and Optimization Algorithms (3 papers). The work is most often cited by research in Numerical Analysis (130 citations), Industrial and Manufacturing Engineering (222 citations) and Computational Theory and Mathematics (170 citations). Matthew J. Saltzman has collaborated with scholars based in United States, Netherlands and South Korea. Frequent co-authors include Egon Balas, Ted K. Ralphs, Marie Coffin, Roy E. Marsten, David F. Shanno, Margaret M. Wiecek, Robert E. Bixby, L. Ladányi, İlker Baybars and Irvin J. Lustig. Their work appears in journals such as European Journal of Operational Research, Operations Research and Mathematical Programming.
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.