A Branch Search Algorithm for the Knapsack Problem

DOI10.1287/mnsc.16.5.327zbMath0191.48401OpenAlexW2066850897MaRDI QIDQ5585877

R. L. Hegerich, Harold Greenberg

Publication date: 1970

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.16.5.327

zbMATH Keywords

operations research

Related Items

A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem, A branch and search algorithm for a class of nonlinear knapsack problems, Dynamic programming algorithms for the zero-one knapsack problem, Heuristics and their design: A survey, An algorithm for the solution of the 0-1 knapsack problem, A branch and bound algorithm for the generalized assignment problem, Resolution of the 0–1 knapsack problem: Comparison of methods, Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem, A o(n logn) algorithm for LP knapsacks with GUB constraints, An algorithm for the 0/1 Knapsack problem, A linear-time algorithm for solving continuous maximin knapsack problems, An upper bound for the zero-one knapsack problem and a branch and bound algorithm, An improved upper bound for the zero-one knapsack problem. A note on the paper by Martello and Toth, A generalized knapsack problem with variable coefficients, The Collapsing 0–1 Knapsack Problem, An algorithm and efficient data structures for the binary knapsack problem, The zero-one knapsack problem with equality constraint, Redundancy optimization by linear knapsack approach, The pure fixed charge transportation problem