Harvey M. Salkin

Available identifiers

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q3992496	1993-01-23	Paper
A set‐partitioning‐based exact algorithm for the vehicle routing problem	1989-01-01	Paper
A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem	1988-01-01	Paper
A note on a general nonlinear knapsack problem	1986-01-01	Paper
A branch and search algorithm for a class of nonlinear knapsack problems	1983-01-01	Paper
An efficient algorithm for the complete set partitioning problem	1983-01-01	Paper
Two backtrack algorithms for the ratio frequency intermodulation problem	1980-01-01	Paper
Using the Blankinship algorithm to find the general solution of a linear diophantine equation	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3208735	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3858004	1978-01-01	Paper
The knapsack problem: A survey	1975-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4082544	1975-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4132001	1975-01-01	Paper
Set Covering by an All Integer Algorithm	1973-01-01	Paper
Integer points on the Gomory fractional cut (hyperplane)	1972-01-01	Paper
A note comparing glover's and young's simplified primal algorithms	1972-01-01	Paper
Technical Note—A Note on Gomory Fractional Cuts	1971-01-01	Paper
Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems	1971-01-01	Paper
Letter to the Editor—On the Merit of the Generalized Origin and Restarts in Implicit Enumeration	1970-01-01	Paper

No records found.

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Harvey M. Salkin