The knapsack problem: a survey
HM Salkin, CA De Kluyver - Naval Research Logistics …, 1975 - Wiley Online Library
… HM SALKIN AND CA DE KLUWER … HM SALKIN AND CA DE KLUYVER … An
excellent survey of these variations can be found in Salkin [68], and Lawler and Wood[56]. …
excellent survey of these variations can be found in Salkin [68], and Lawler and Wood[56]. …
A set‐partitioning‐based exact algorithm for the vehicle routing problem
In this paper, we discuss a computationally viable algorithm based on a set‐partitioning for‐mulation
of the Vehicle Routing Problem (VRP). Implementation strategies based on …
of the Vehicle Routing Problem (VRP). Implementation strategies based on …
Set covering by single-branch enumeration with linear-programming subproblems
CE Lemke, HM Salkin, K Spielberg - Operations Research, 1971 - pubsonline.informs.org
This paper presents an algorithm for the set-covering problem (that is, min c′y: Ey ≧ e, y
≧ 0, y i integer, where E is an m by n matrix of l's and 0's, and e is an m-vector of l's). The …
≧ 0, y i integer, where E is an m by n matrix of l's and 0's, and e is an m-vector of l's). The …
A branch and search algorithm for a class of nonlinear knapsack problems
K Mathur, HM Salkin, S Morito - Operations Research Letters, 1983 - Elsevier
This paper discusses a class of nonlinear knapsack problems where the objective function
is quadratic. The method is a branch and search procedure which includes an efficient …
is quadratic. The method is a branch and search procedure which includes an efficient …
A surrogate relaxation based algorithm for a general quadratic multi-dimensional knapsack problem
M Djerdjour, K Mathur, HM Salkin - Operations Research Letters, 1988 - Elsevier
In this paper, we develop a framework to solve a General Quadratic Multi-dimensional
Knapsack Problem using surrogate relaxation. This paper exploits the fact that a continuous …
Knapsack Problem using surrogate relaxation. This paper exploits the fact that a continuous …
Set covering by an all integer algorithm: Computational experience
RD Koncal, HM Salkin - Journal of the ACM (JACM), 1973 - dl.acm.org
Computational experience with a modified linear programming method for the inequality or
equality set covering problem (ie minimize cx subject to Ex ≥ e or Ex = e, x i = 0 or 1, where …
equality set covering problem (ie minimize cx subject to Ex ≥ e or Ex = e, x i = 0 or 1, where …
A note on a general non-linear knapsack problem
K Mathur, HM Salkin, BB Mohanty - Operations Research Letters, 1986 - Elsevier
This paper discusses a general non-linear knapsack problem with a concave objective function
and a single conves constraint. in particular, it includes an efficient procedure to find the …
and a single conves constraint. in particular, it includes an efficient procedure to find the …
On the merit of the generalized origin and restarts in implicit enumeration
HM Salkin - Operations Research, 1970 - pubsonline.informs.org
This note discusses the concept of starting a (zero-one) tree search at an integer solution
obtained from the associated linear program and restarting it at improved feasible solutions. …
obtained from the associated linear program and restarting it at improved feasible solutions. …
Using the Blankinship algorithm to find the general solution of a linear Diophantine equation
S Morito, HM Salkin - Acta Informatica, 1980 - Springer
… Morito, S., Salkin, HM: Finding the general solution of a linear diophantine equation,
Technical memorandum No. 429, Department of Operations Research, Case Western Reserve …
Technical memorandum No. 429, Department of Operations Research, Case Western Reserve …
An efficient algorithm for the complete set partitioning problem
CHM Lin, HM Salkin - Discrete Applied Mathematics, 1983 - Elsevier
The complete set partitioning problem is the well known set partitioning problem with all
possible nonzero binary columns in the constraint matrix. A highly specialized enumerative …
possible nonzero binary columns in the constraint matrix. A highly specialized enumerative …