Harvey M. Salkin

According to our database, Harvey M. Salkin authored at least 7 papers between 1970 and 1989.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

1989

A set-partitioning-based exact algorithm for the vehicle routing problem.

Yogesh Agarwal, Kamlesh Mathur, Harvey M. Salkin

Networks, 1989

Foundations of integer programming.

Harvey M. Salkin, Kamlesh Mathur

North-Holland, ISBN: 978-0-444-01231-9, 1989

1983

An efficient algorithm for the complete set partitioning problem.

Chien-Hua M. Lin, Harvey M. Salkin

Discret. Appl. Math., 1983

1980

Using the Blankinship Algorithm to Find the General Solution of a Linear Diophantine Equation.

Susumu Morito, Harvey M. Salkin

Acta Informatica, 1980

1973

Set Covering by an All Integer Algorithm: Computational Experience.

Harvey M. Salkin, Ronald D. Koncal

J. ACM, 1973

1971

Technical Note - A Note on Gomory Fractional Cuts.

Harvey M. Salkin

Oper. Res., 1971

1970

Letter to the Editor - On the Merit of the Generalized Origin and Restarts in Implicit Enumeration.

Harvey M. Salkin

Oper. Res., 1970