Letter to the Editor - On the Merit of the Generalized Origin and Restarts in Implicit Enumeration. - Harvey M. Salkin (Oper. Res., 1970)

Technical Note - A Note on Gomory Fractional Cuts. - Harvey M. Salkin (Oper. Res., 1971)

Set Covering by an All Integer Algorithm: Computational Experience. - Harvey M. Salkin; Ronald D. Koncal (J. ACM, 1973)

Using the Blankinship Algorithm to Find the General Solution of a Linear Diophantine Equation. - Susumu Morito; Harvey M. Salkin (Acta Informatica, 1980)

An efficient algorithm for the complete set partitioning problem. - Chien-Hua M. Lin; Harvey M. Salkin (Discret. Appl. Math., 1983)

Foundations of integer programming. - Harvey M. Salkin; Kamlesh Mathur (North-Holland, 1989)

A set-partitioning-based exact algorithm for the vehicle routing problem. - Yogesh Agarwal; Kamlesh Mathur; Harvey M. Salkin (Networks, 1989)