Harvey M. Salkin

1.1k total citations
25 papers, 703 citations indexed

About

Harvey M. Salkin is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Control and Systems Engineering. According to data from OpenAlex, Harvey M. Salkin has authored 25 papers receiving a total of 703 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Industrial and Manufacturing Engineering, 8 papers in Computer Networks and Communications and 3 papers in Control and Systems Engineering. Recurrent topics in Harvey M. Salkin's work include Optimization and Packing Problems (9 papers), Optimization and Search Problems (7 papers) and Advanced Manufacturing and Logistics Optimization (5 papers). Harvey M. Salkin is often cited by papers focused on Optimization and Packing Problems (9 papers), Optimization and Search Problems (7 papers) and Advanced Manufacturing and Logistics Optimization (5 papers). Harvey M. Salkin collaborates with scholars based in United States and Japan. Harvey M. Salkin's co-authors include Kamlesh Mathur, Cornelis A. de Kluyver, Robert Haas, C. E. Lemke, Kurt Spielberg, Yogesh K. Agarwal, David E. Williams, Peter Ritchken, Koichi Nishimura and Koichi Nishimura and has published in prestigious journals such as Management Science, The Economic Journal and Operations Research.

In The Last Decade

Harvey M. Salkin

22 papers receiving 648 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Harvey M. Salkin United States	10	399	172	117	96	91	25	703
Mandell Bellmore United States	12	436 1.1×	130 0.8×	116 1.0×	66 0.7×	131 1.4×	20	780
Robert M. Nauss United States	11	445 1.1×	157 0.9×	46 0.4×	111 1.2×	56 0.6×	29	717
Gordon H. Bradley United States	11	176 0.4×	117 0.7×	163 1.4×	172 1.8×	62 0.7×	22	573
J. B. G. Frenk Netherlands	18	396 1.0×	156 0.9×	200 1.7×	160 1.7×	58 0.6×	81	1.0k
Loren K. Platzman United States	12	404 1.0×	142 0.8×	80 0.7×	54 0.6×	119 1.3×	23	805
K. P. K. Nair Canada	14	339 0.8×	186 1.1×	255 2.2×	290 3.0×	68 0.7×	55	992
D. Karney United States	10	201 0.5×	110 0.6×	243 2.1×	250 2.6×	50 0.5×	12	845
O. du Merle Switzerland	8	240 0.6×	55 0.3×	96 0.8×	67 0.7×	76 0.8×	10	497
Emilie Danna United States	9	295 0.7×	229 1.3×	159 1.4×	118 1.2×	95 1.0×	9	698
Moshe B. Rosenwein United States	13	490 1.2×	96 0.6×	53 0.5×	46 0.5×	72 0.8×	26	630

Countries citing papers authored by Harvey M. Salkin

Since Specialization

Citations

This map shows the geographic impact of Harvey M. Salkin'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 Harvey M. Salkin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Harvey M. Salkin more than expected).

Fields of papers citing papers by Harvey M. Salkin

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Harvey M. Salkin. 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 Harvey M. Salkin. The network helps show where Harvey M. Salkin may publish in the future.

Co-authorship network of co-authors of Harvey M. Salkin

This figure shows the co-authorship network connecting the top 25 collaborators of Harvey M. Salkin. A scholar is included among the top collaborators of Harvey M. Salkin 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 Harvey M. Salkin. Harvey M. Salkin 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:

20 of 20 papers shown

Ashton, David J., et al.. (1990). Portfolio Risk Management: A Computer Simulation for Stocks and Options.. The Economic Journal. 100(401). 655–655. 1 indexed citations

Agarwal, Yogesh K., Kamlesh Mathur, & Harvey M. Salkin. (1989). A set‐partitioning‐based exact algorithm for the vehicle routing problem. Networks. 19(7). 731–749. 74 indexed citations

Salkin, Harvey M., Kamlesh Mathur, & Robert Haas. (1989). Foundations of integer programming. 110 indexed citations

Mathur, Kamlesh, et al.. (1988). A surrogate relaxation based algorithm for a general quadratic multi-dimensional knapsack problem. Operations Research Letters. 7(5). 253–258. 23 indexed citations

Mathur, Kamlesh, et al.. (1985). An efficient alorithm for the general multiple-choice knapsack problem (GMKP). Annals of Operations Research. 4(1). 253–283. 3 indexed citations

Mathur, Kamlesh, et al.. (1984). The Design of an Interactive Computer Software System for the Frequency-Assignment Problem. IEEE Transactions on Electromagnetic Compatibility. EMC-26(4). 207–212. 3 indexed citations

Ritchken, Peter & Harvey M. Salkin. (1983). Safety first selection techniques for option spreads. The Journal of Portfolio Management. 9(3). 61–67. 1 indexed citations

Salkin, Harvey M., et al.. (1983). An efficient algorithm for the complete set partitioning problem. Discrete Applied Mathematics. 6(2). 149–156. 6 indexed citations

Mathur, Kamlesh, et al.. (1983). A branch and search algorithm for a class of nonlinear knapsack problems. Operations Research Letters. 2(4). 155–160. 38 indexed citations

10.

Salkin, Harvey M., et al.. (1981). Computational Experience with a Dual Backtrack Algorithm for Identifying Frequencies Likely to Create Intermodulation Problems. IEEE Transactions on Electromagnetic Compatibility. EMC-23(1). 32–36. 5 indexed citations

11.

Salkin, Harvey M., et al.. (1980). Two backtrack algorithms for the radio frequency intermodulation problem. Applied Mathematics & Optimization. 6(1). 221–240. 6 indexed citations

12.

Salkin, Harvey M., et al.. (1980). Using the Blankinship algorithm to find the general solution of a linear diophantine equation. Acta Informatica. 13(4). 379–382. 9 indexed citations

13.

Salkin, Harvey M., et al.. (1979). Finding the General Solution of a Linear Diophantine Equation. The Fibonacci quarterly. 17(4). 361–368. 1 indexed citations

14.

Salkin, Harvey M. & Cornelis A. de Kluyver. (1975). The knapsack problem: A survey. Naval Research Logistics Quarterly. 22(1). 127–144. 121 indexed citations

15.

Salkin, Harvey M.. (1975). Integer programming. CERN Document Server (European Organization for Nuclear Research). 148 indexed citations

16.

Salkin, Harvey M., et al.. (1973). Set Covering by an All Integer Algorithm. Journal of the ACM. 20(2). 189–193. 29 indexed citations

17.

Salkin, Harvey M., et al.. (1971). Integer points on the Gomory fractional cut (hyperplane). Naval Research Logistics Quarterly. 18(4). 491–496.

18.

Salkin, Harvey M.. (1971). Technical Note—A Note on Gomory Fractional Cuts. Operations Research. 19(6). 1538–1541. 2 indexed citations

19.

Lemke, C. E., Harvey M. Salkin, & Kurt Spielberg. (1971). Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems. Operations Research. 19(4). 998–1022. 91 indexed citations

20.

Salkin, Harvey M.. (1969). Enumerative algorithms for integer and mixed integer programs. 1 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